/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:59:24,337 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:59:24,339 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:59:24,378 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:59:24,378 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:59:24,381 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:59:24,383 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:59:24,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:59:24,392 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:59:24,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:59:24,397 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:59:24,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:59:24,400 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:59:24,402 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:59:24,403 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:59:24,403 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:59:24,404 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:59:24,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:59:24,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:59:24,407 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:59:24,408 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:59:24,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:59:24,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:59:24,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:59:24,414 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:59:24,414 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:59:24,415 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:59:24,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:59:24,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:59:24,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:59:24,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:59:24,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:59:24,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:59:24,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:59:24,419 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:59:24,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:59:24,420 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:59:24,420 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:59:24,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:59:24,421 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:59:24,421 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:59:24,422 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:59:24,446 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:59:24,446 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:59:24,448 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:59:24,448 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:59:24,448 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:59:24,449 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:59:24,449 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:59:24,449 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:59:24,450 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:59:24,450 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:59:24,450 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:59:24,451 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:59:24,451 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:59:24,451 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:59:24,451 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:59:24,451 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:59:24,451 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:59:24,452 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:59:24,452 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:59:24,452 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:59:24,452 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:59:24,452 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:59:24,452 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:59:24,452 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:59:24,453 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:59:24,453 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:59:24,453 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:59:24,453 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:59:24,453 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 04:59:24,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:59:24,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:59:24,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:59:24,786 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:59:24,786 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:59:24,787 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2022-12-06 04:59:25,963 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:59:26,190 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:59:26,192 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2022-12-06 04:59:26,202 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8553c13b5/402272051a4044a5b154dbd5f67f75d0/FLAGb4cf3379a [2022-12-06 04:59:26,223 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8553c13b5/402272051a4044a5b154dbd5f67f75d0 [2022-12-06 04:59:26,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:59:26,227 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:59:26,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:59:26,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:59:26,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:59:26,233 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ca9e8d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26, skipping insertion in model container [2022-12-06 04:59:26,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:59:26,256 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:59:26,397 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-exp1x3.wvr.c[1849,1862] [2022-12-06 04:59:26,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:59:26,407 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:59:26,422 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-exp1x3.wvr.c[1849,1862] [2022-12-06 04:59:26,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:59:26,436 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:59:26,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26 WrapperNode [2022-12-06 04:59:26,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:59:26,437 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:59:26,437 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:59:26,437 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:59:26,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,449 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,464 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 57 [2022-12-06 04:59:26,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:59:26,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:59:26,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:59:26,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:59:26,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,473 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,481 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:59:26,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:59:26,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:59:26,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:59:26,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26" (1/1) ... [2022-12-06 04:59:26,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:59:26,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:59:26,517 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 04:59:26,543 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 04:59:26,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:59:26,560 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 04:59:26,562 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 04:59:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 04:59:26,562 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 04:59:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:59:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:59:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:59:26,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:59:26,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:59:26,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:59:26,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:59:26,564 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 04:59:26,662 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:59:26,664 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:59:26,834 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:59:26,840 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:59:26,840 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 04:59:26,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:59:26 BoogieIcfgContainer [2022-12-06 04:59:26,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:59:26,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:59:26,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:59:26,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:59:26,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:59:26" (1/3) ... [2022-12-06 04:59:26,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56960d1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:59:26, skipping insertion in model container [2022-12-06 04:59:26,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:59:26" (2/3) ... [2022-12-06 04:59:26,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56960d1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:59:26, skipping insertion in model container [2022-12-06 04:59:26,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:59:26" (3/3) ... [2022-12-06 04:59:26,848 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2022-12-06 04:59:26,869 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:59:26,869 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 04:59:26,869 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:59:26,938 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 04:59:26,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 74 transitions, 164 flow [2022-12-06 04:59:27,041 INFO L130 PetriNetUnfolder]: 6/72 cut-off events. [2022-12-06 04:59:27,042 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 04:59:27,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 72 events. 6/72 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2022-12-06 04:59:27,047 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 74 transitions, 164 flow [2022-12-06 04:59:27,051 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 64 transitions, 140 flow [2022-12-06 04:59:27,052 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:27,073 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 64 transitions, 140 flow [2022-12-06 04:59:27,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 65 places, 64 transitions, 140 flow [2022-12-06 04:59:27,109 INFO L130 PetriNetUnfolder]: 6/64 cut-off events. [2022-12-06 04:59:27,109 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 04:59:27,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 64 events. 6/64 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2022-12-06 04:59:27,119 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 64 transitions, 140 flow [2022-12-06 04:59:27,120 INFO L188 LiptonReduction]: Number of co-enabled transitions 252 [2022-12-06 04:59:29,597 INFO L203 LiptonReduction]: Total number of compositions: 51 [2022-12-06 04:59:29,617 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:59:29,621 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;@1319f12b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:59:29,622 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 04:59:29,626 INFO L130 PetriNetUnfolder]: 2/12 cut-off events. [2022-12-06 04:59:29,626 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 04:59:29,626 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:29,627 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:29,627 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:29,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:29,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1519162272, now seen corresponding path program 1 times [2022-12-06 04:59:29,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:29,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840278308] [2022-12-06 04:59:29,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:29,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:30,078 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 04:59:30,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:30,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840278308] [2022-12-06 04:59:30,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840278308] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:30,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:30,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:59:30,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678487826] [2022-12-06 04:59:30,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:30,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:59:30,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:30,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:59:30,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:59:30,111 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 04:59:30,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 13 transitions, 38 flow. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states 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 04:59:30,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:30,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 04:59:30,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:30,174 INFO L130 PetriNetUnfolder]: 41/77 cut-off events. [2022-12-06 04:59:30,175 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-06 04:59:30,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 77 events. 41/77 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 164 event pairs, 9 based on Foata normal form. 1/54 useless extension candidates. Maximal degree in co-relation 120. Up to 51 conditions per place. [2022-12-06 04:59:30,179 INFO L137 encePairwiseOnDemand]: 9/13 looper letters, 19 selfloop transitions, 3 changer transitions 1/23 dead transitions. [2022-12-06 04:59:30,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 23 transitions, 113 flow [2022-12-06 04:59:30,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:59:30,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:59:30,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-12-06 04:59:30,189 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2022-12-06 04:59:30,191 INFO L175 Difference]: Start difference. First operand has 18 places, 13 transitions, 38 flow. Second operand 3 states and 24 transitions. [2022-12-06 04:59:30,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 23 transitions, 113 flow [2022-12-06 04:59:30,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 23 transitions, 99 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:59:30,196 INFO L231 Difference]: Finished difference. Result has 17 places, 15 transitions, 49 flow [2022-12-06 04:59:30,198 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=49, PETRI_PLACES=17, PETRI_TRANSITIONS=15} [2022-12-06 04:59:30,201 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, -1 predicate places. [2022-12-06 04:59:30,201 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:30,202 INFO L89 Accepts]: Start accepts. Operand has 17 places, 15 transitions, 49 flow [2022-12-06 04:59:30,206 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:30,206 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:30,206 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 17 places, 15 transitions, 49 flow [2022-12-06 04:59:30,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 17 places, 15 transitions, 49 flow [2022-12-06 04:59:30,224 INFO L130 PetriNetUnfolder]: 5/23 cut-off events. [2022-12-06 04:59:30,225 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:59:30,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 23 events. 5/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 18. Up to 8 conditions per place. [2022-12-06 04:59:30,244 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 17 places, 15 transitions, 49 flow [2022-12-06 04:59:30,244 INFO L188 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-06 04:59:30,245 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:30,248 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 47 [2022-12-06 04:59:30,248 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 15 transitions, 49 flow [2022-12-06 04:59:30,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states 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 04:59:30,248 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:30,248 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:30,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:59:30,252 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:30,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:30,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1048590378, now seen corresponding path program 1 times [2022-12-06 04:59:30,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:30,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863524482] [2022-12-06 04:59:30,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:30,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:30,420 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 04:59:30,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:30,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863524482] [2022-12-06 04:59:30,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863524482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:30,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:30,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:59:30,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287642007] [2022-12-06 04:59:30,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:30,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:59:30,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:30,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:59:30,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:59:30,433 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 04:59:30,433 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 15 transitions, 49 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:30,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:30,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 04:59:30,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:30,544 INFO L130 PetriNetUnfolder]: 39/75 cut-off events. [2022-12-06 04:59:30,544 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-06 04:59:30,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 75 events. 39/75 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 167 event pairs, 2 based on Foata normal form. 2/77 useless extension candidates. Maximal degree in co-relation 55. Up to 28 conditions per place. [2022-12-06 04:59:30,545 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 24 selfloop transitions, 6 changer transitions 4/34 dead transitions. [2022-12-06 04:59:30,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 34 transitions, 165 flow [2022-12-06 04:59:30,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:59:30,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:59:30,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-12-06 04:59:30,546 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2022-12-06 04:59:30,546 INFO L175 Difference]: Start difference. First operand has 17 places, 15 transitions, 49 flow. Second operand 5 states and 35 transitions. [2022-12-06 04:59:30,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 34 transitions, 165 flow [2022-12-06 04:59:30,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 34 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:59:30,548 INFO L231 Difference]: Finished difference. Result has 21 places, 17 transitions, 70 flow [2022-12-06 04:59:30,548 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=70, PETRI_PLACES=21, PETRI_TRANSITIONS=17} [2022-12-06 04:59:30,549 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 3 predicate places. [2022-12-06 04:59:30,549 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:30,549 INFO L89 Accepts]: Start accepts. Operand has 21 places, 17 transitions, 70 flow [2022-12-06 04:59:30,549 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:30,550 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:30,550 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 17 transitions, 70 flow [2022-12-06 04:59:30,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 17 transitions, 70 flow [2022-12-06 04:59:30,554 INFO L130 PetriNetUnfolder]: 8/28 cut-off events. [2022-12-06 04:59:30,554 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 04:59:30,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 28 events. 8/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 42 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 36. Up to 10 conditions per place. [2022-12-06 04:59:30,555 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 17 transitions, 70 flow [2022-12-06 04:59:30,555 INFO L188 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-06 04:59:30,555 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:30,556 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 04:59:30,556 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 17 transitions, 70 flow [2022-12-06 04:59:30,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:30,557 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:30,557 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:30,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:59:30,557 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:30,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:30,558 INFO L85 PathProgramCache]: Analyzing trace with hash -534469176, now seen corresponding path program 1 times [2022-12-06 04:59:30,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:30,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121137553] [2022-12-06 04:59:30,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:30,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:30,653 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 04:59:30,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:30,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121137553] [2022-12-06 04:59:30,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121137553] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:30,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:30,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 04:59:30,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480873787] [2022-12-06 04:59:30,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:30,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 04:59:30,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:30,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 04:59:30,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 04:59:30,656 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 04:59:30,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:30,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:30,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 04:59:30,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:30,705 INFO L130 PetriNetUnfolder]: 32/66 cut-off events. [2022-12-06 04:59:30,705 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2022-12-06 04:59:30,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 66 events. 32/66 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 141 event pairs, 6 based on Foata normal form. 4/70 useless extension candidates. Maximal degree in co-relation 57. Up to 45 conditions per place. [2022-12-06 04:59:30,706 INFO L137 encePairwiseOnDemand]: 9/13 looper letters, 15 selfloop transitions, 3 changer transitions 8/26 dead transitions. [2022-12-06 04:59:30,706 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 26 transitions, 142 flow [2022-12-06 04:59:30,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 04:59:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 04:59:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-12-06 04:59:30,713 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5192307692307693 [2022-12-06 04:59:30,713 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 70 flow. Second operand 4 states and 27 transitions. [2022-12-06 04:59:30,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 26 transitions, 142 flow [2022-12-06 04:59:30,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 26 transitions, 139 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:59:30,715 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 62 flow [2022-12-06 04:59:30,715 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=62, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2022-12-06 04:59:30,716 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2022-12-06 04:59:30,716 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:30,716 INFO L89 Accepts]: Start accepts. Operand has 23 places, 15 transitions, 62 flow [2022-12-06 04:59:30,717 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:30,718 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:30,718 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 15 transitions, 62 flow [2022-12-06 04:59:30,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 15 transitions, 62 flow [2022-12-06 04:59:30,724 INFO L130 PetriNetUnfolder]: 6/20 cut-off events. [2022-12-06 04:59:30,724 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 04:59:30,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 20 events. 6/20 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 19 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 26. Up to 8 conditions per place. [2022-12-06 04:59:30,728 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 15 transitions, 62 flow [2022-12-06 04:59:30,728 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-06 04:59:30,729 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:30,730 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 04:59:30,730 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 15 transitions, 62 flow [2022-12-06 04:59:30,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:30,731 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:30,731 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:30,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:59:30,731 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:30,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:30,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1209496712, now seen corresponding path program 2 times [2022-12-06 04:59:30,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:30,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841890037] [2022-12-06 04:59:30,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:30,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:30,842 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 04:59:30,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:30,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841890037] [2022-12-06 04:59:30,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841890037] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:59:30,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695535618] [2022-12-06 04:59:30,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 04:59:30,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:30,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:59:30,850 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 04:59:30,857 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 04:59:30,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 04:59:30,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 04:59:30,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 04:59:30,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:59:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:31,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:59:31,136 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 04:59:31,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695535618] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:59:31,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:59:31,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 04:59:31,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17458992] [2022-12-06 04:59:31,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:59:31,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:59:31,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:31,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:59:31,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:59:31,138 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 04:59:31,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 15 transitions, 62 flow. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:31,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:31,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 04:59:31,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:31,266 INFO L130 PetriNetUnfolder]: 34/63 cut-off events. [2022-12-06 04:59:31,266 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-06 04:59:31,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 63 events. 34/63 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 113 event pairs, 4 based on Foata normal form. 6/69 useless extension candidates. Maximal degree in co-relation 49. Up to 39 conditions per place. [2022-12-06 04:59:31,267 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 22 selfloop transitions, 6 changer transitions 0/28 dead transitions. [2022-12-06 04:59:31,267 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 28 transitions, 155 flow [2022-12-06 04:59:31,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:59:31,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:59:31,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-12-06 04:59:31,270 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2022-12-06 04:59:31,271 INFO L175 Difference]: Start difference. First operand has 21 places, 15 transitions, 62 flow. Second operand 5 states and 30 transitions. [2022-12-06 04:59:31,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 28 transitions, 155 flow [2022-12-06 04:59:31,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 28 transitions, 147 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 04:59:31,272 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 91 flow [2022-12-06 04:59:31,272 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2022-12-06 04:59:31,273 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 7 predicate places. [2022-12-06 04:59:31,273 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:31,273 INFO L89 Accepts]: Start accepts. Operand has 25 places, 18 transitions, 91 flow [2022-12-06 04:59:31,274 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:31,274 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:31,274 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 18 transitions, 91 flow [2022-12-06 04:59:31,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 18 transitions, 91 flow [2022-12-06 04:59:31,278 INFO L130 PetriNetUnfolder]: 6/23 cut-off events. [2022-12-06 04:59:31,278 INFO L131 PetriNetUnfolder]: For 14/16 co-relation queries the response was YES. [2022-12-06 04:59:31,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 23 events. 6/23 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 26 event pairs, 1 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 43. Up to 8 conditions per place. [2022-12-06 04:59:31,278 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 18 transitions, 91 flow [2022-12-06 04:59:31,279 INFO L188 LiptonReduction]: Number of co-enabled transitions 46 [2022-12-06 04:59:31,279 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:31,280 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 04:59:31,280 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 91 flow [2022-12-06 04:59:31,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:31,280 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:31,281 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:31,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 04:59:31,487 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 04:59:31,487 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:31,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:31,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1163420716, now seen corresponding path program 2 times [2022-12-06 04:59:31,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:31,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73195250] [2022-12-06 04:59:31,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:31,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:31,585 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 04:59:31,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:31,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73195250] [2022-12-06 04:59:31,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73195250] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:59:31,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808141947] [2022-12-06 04:59:31,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 04:59:31,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:31,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:59:31,588 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 04:59:31,591 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 04:59:31,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 04:59:31,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 04:59:31,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 04:59:31,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:59:31,711 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 04:59:31,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:59:31,756 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 04:59:31,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808141947] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:59:31,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:59:31,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 04:59:31,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187409580] [2022-12-06 04:59:31,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:59:31,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 04:59:31,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:31,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 04:59:31,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 04:59:31,762 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 04:59:31,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 91 flow. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:31,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:31,762 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 04:59:31,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:31,841 INFO L130 PetriNetUnfolder]: 40/73 cut-off events. [2022-12-06 04:59:31,842 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-06 04:59:31,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 73 events. 40/73 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 136 event pairs, 4 based on Foata normal form. 4/77 useless extension candidates. Maximal degree in co-relation 119. Up to 61 conditions per place. [2022-12-06 04:59:31,843 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 21 selfloop transitions, 6 changer transitions 0/27 dead transitions. [2022-12-06 04:59:31,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 27 transitions, 178 flow [2022-12-06 04:59:31,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 04:59:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 04:59:31,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-12-06 04:59:31,845 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-06 04:59:31,845 INFO L175 Difference]: Start difference. First operand has 25 places, 18 transitions, 91 flow. Second operand 5 states and 26 transitions. [2022-12-06 04:59:31,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 27 transitions, 178 flow [2022-12-06 04:59:31,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 27 transitions, 173 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-06 04:59:31,849 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 127 flow [2022-12-06 04:59:31,849 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2022-12-06 04:59:31,851 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 12 predicate places. [2022-12-06 04:59:31,852 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:31,852 INFO L89 Accepts]: Start accepts. Operand has 30 places, 21 transitions, 127 flow [2022-12-06 04:59:31,853 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:31,853 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:31,853 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 21 transitions, 127 flow [2022-12-06 04:59:31,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 21 transitions, 127 flow [2022-12-06 04:59:31,858 INFO L130 PetriNetUnfolder]: 9/26 cut-off events. [2022-12-06 04:59:31,859 INFO L131 PetriNetUnfolder]: For 29/30 co-relation queries the response was YES. [2022-12-06 04:59:31,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 26 events. 9/26 cut-off events. For 29/30 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 1/27 useless extension candidates. Maximal degree in co-relation 72. Up to 11 conditions per place. [2022-12-06 04:59:31,859 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 21 transitions, 127 flow [2022-12-06 04:59:31,859 INFO L188 LiptonReduction]: Number of co-enabled transitions 52 [2022-12-06 04:59:31,862 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [250] L46-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_~x2~0_In_5 4294967296) (mod v_~n~0_In_1 4294967296)))) InVars {~n~0=v_~n~0_In_1, ~x2~0=v_~x2~0_In_5} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, ~x2~0=v_~x2~0_In_5, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] and [246] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_52 4294967296) (mod v_~n~0_47 4294967296)) (= v_~x1~0_51 (* v_~x1~0_52 2))) InVars {~n~0=v_~n~0_47, ~x1~0=v_~x1~0_52} OutVars{~n~0=v_~n~0_47, ~x1~0=v_~x1~0_51} AuxVars[] AssignedVars[~x1~0] [2022-12-06 04:59:31,922 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:59:31,923 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 71 [2022-12-06 04:59:31,923 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 20 transitions, 125 flow [2022-12-06 04:59:31,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:31,923 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:31,923 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:31,932 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 04:59:32,124 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 04:59:32,124 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:32,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:32,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1846571948, now seen corresponding path program 1 times [2022-12-06 04:59:32,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:32,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320678817] [2022-12-06 04:59:32,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:32,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:32,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:59:32,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:32,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320678817] [2022-12-06 04:59:32,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320678817] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:59:32,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480642940] [2022-12-06 04:59:32,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:32,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:32,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:59:32,514 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 04:59:32,517 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 04:59:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:32,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 04:59:32,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:59:32,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 04:59:32,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 04:59:32,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480642940] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:32,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 04:59:32,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-12-06 04:59:32,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760458677] [2022-12-06 04:59:32,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:32,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:59:32,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:32,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:59:32,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 04:59:32,702 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 04:59:32,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 20 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:32,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:32,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 04:59:32,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:32,739 INFO L130 PetriNetUnfolder]: 23/44 cut-off events. [2022-12-06 04:59:32,739 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2022-12-06 04:59:32,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 44 events. 23/44 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 4/48 useless extension candidates. Maximal degree in co-relation 100. Up to 40 conditions per place. [2022-12-06 04:59:32,740 INFO L137 encePairwiseOnDemand]: 11/14 looper letters, 15 selfloop transitions, 2 changer transitions 0/17 dead transitions. [2022-12-06 04:59:32,740 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 17 transitions, 131 flow [2022-12-06 04:59:32,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:59:32,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:59:32,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2022-12-06 04:59:32,741 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2022-12-06 04:59:32,741 INFO L175 Difference]: Start difference. First operand has 29 places, 20 transitions, 125 flow. Second operand 3 states and 17 transitions. [2022-12-06 04:59:32,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 17 transitions, 131 flow [2022-12-06 04:59:32,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 17 transitions, 105 flow, removed 11 selfloop flow, removed 5 redundant places. [2022-12-06 04:59:32,743 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 73 flow [2022-12-06 04:59:32,743 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2022-12-06 04:59:32,744 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 6 predicate places. [2022-12-06 04:59:32,744 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:32,744 INFO L89 Accepts]: Start accepts. Operand has 24 places, 16 transitions, 73 flow [2022-12-06 04:59:32,744 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:32,745 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:32,745 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 16 transitions, 73 flow [2022-12-06 04:59:32,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 16 transitions, 73 flow [2022-12-06 04:59:32,748 INFO L130 PetriNetUnfolder]: 6/22 cut-off events. [2022-12-06 04:59:32,748 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 04:59:32,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 22 events. 6/22 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 36. Up to 8 conditions per place. [2022-12-06 04:59:32,748 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 16 transitions, 73 flow [2022-12-06 04:59:32,748 INFO L188 LiptonReduction]: Number of co-enabled transitions 26 [2022-12-06 04:59:32,749 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:32,749 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 04:59:32,749 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 73 flow [2022-12-06 04:59:32,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:59:32,750 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:32,750 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:32,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 04:59:32,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:32,958 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:32,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:32,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1077533263, now seen corresponding path program 1 times [2022-12-06 04:59:32,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:32,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455623242] [2022-12-06 04:59:32,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:32,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:33,206 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 04:59:33,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:33,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455623242] [2022-12-06 04:59:33,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455623242] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:59:33,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876239327] [2022-12-06 04:59:33,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:33,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:33,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:59:33,212 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 04:59:33,220 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 04:59:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:33,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-06 04:59:33,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 04:59:36,393 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 04:59:36,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 04:59:38,466 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 04:59:38,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876239327] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 04:59:38,467 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 04:59:38,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2022-12-06 04:59:38,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197743311] [2022-12-06 04:59:38,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 04:59:38,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 04:59:38,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:38,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 04:59:38,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=61, Unknown=1, NotChecked=0, Total=90 [2022-12-06 04:59:38,469 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 14 [2022-12-06 04:59:38,469 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 73 flow. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 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 04:59:38,469 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:38,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 14 [2022-12-06 04:59:38,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:41,069 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 04:59:43,331 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 04:59:45,337 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 04:59:50,849 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 04:59:52,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 04:59:54,883 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 04:59:54,963 INFO L130 PetriNetUnfolder]: 31/62 cut-off events. [2022-12-06 04:59:54,963 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-12-06 04:59:54,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 62 events. 31/62 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 108 event pairs, 0 based on Foata normal form. 1/63 useless extension candidates. Maximal degree in co-relation 94. Up to 45 conditions per place. [2022-12-06 04:59:54,964 INFO L137 encePairwiseOnDemand]: 7/14 looper letters, 16 selfloop transitions, 8 changer transitions 6/30 dead transitions. [2022-12-06 04:59:54,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 30 transitions, 189 flow [2022-12-06 04:59:54,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 04:59:54,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 04:59:54,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-12-06 04:59:54,965 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2022-12-06 04:59:54,965 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 73 flow. Second operand 6 states and 30 transitions. [2022-12-06 04:59:54,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 30 transitions, 189 flow [2022-12-06 04:59:54,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 30 transitions, 185 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 04:59:54,966 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 138 flow [2022-12-06 04:59:54,966 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=14, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2022-12-06 04:59:54,967 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 12 predicate places. [2022-12-06 04:59:54,967 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:54,967 INFO L89 Accepts]: Start accepts. Operand has 30 places, 22 transitions, 138 flow [2022-12-06 04:59:54,968 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:54,968 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:54,968 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 22 transitions, 138 flow [2022-12-06 04:59:54,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 22 transitions, 138 flow [2022-12-06 04:59:54,972 INFO L130 PetriNetUnfolder]: 13/40 cut-off events. [2022-12-06 04:59:54,972 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2022-12-06 04:59:54,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 40 events. 13/40 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 71 event pairs, 1 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 104. Up to 16 conditions per place. [2022-12-06 04:59:54,973 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 22 transitions, 138 flow [2022-12-06 04:59:54,973 INFO L188 LiptonReduction]: Number of co-enabled transitions 28 [2022-12-06 04:59:55,080 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [224] L46-1-->L46-1: Formula: (and (< (mod v_~x2~0_22 4294967296) (mod v_~n~0_19 4294967296)) (= (* v_~x2~0_22 2) v_~x2~0_21)) InVars {~x2~0=v_~x2~0_22, ~n~0=v_~n~0_19} OutVars{~x2~0=v_~x2~0_21, ~n~0=v_~n~0_19} AuxVars[] AssignedVars[~x2~0] and [246] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_52 4294967296) (mod v_~n~0_47 4294967296)) (= v_~x1~0_51 (* v_~x1~0_52 2))) InVars {~n~0=v_~n~0_47, ~x1~0=v_~x1~0_52} OutVars{~n~0=v_~n~0_47, ~x1~0=v_~x1~0_51} AuxVars[] AssignedVars[~x1~0] [2022-12-06 04:59:55,152 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [214] L65-4-->L66-1: Formula: (= |v_ULTIMATE.start_main_#t~mem8#1_12| (select (select |v_#memory_int_27| |v_ULTIMATE.start_main_~#t1~0#1.base_21|) |v_ULTIMATE.start_main_~#t1~0#1.offset_21|)) InVars {#memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_17|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_12|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_11|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_21|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~nondet7#1] and [246] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_52 4294967296) (mod v_~n~0_47 4294967296)) (= v_~x1~0_51 (* v_~x1~0_52 2))) InVars {~n~0=v_~n~0_47, ~x1~0=v_~x1~0_52} OutVars{~n~0=v_~n~0_47, ~x1~0=v_~x1~0_51} AuxVars[] AssignedVars[~x1~0] [2022-12-06 04:59:55,179 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [254] L46-1-->L38-1: Formula: (let ((.cse0 (mod v_~n~0_55 4294967296))) (and (= v_~x1~0_67 (* v_~x1~0_68 2)) (not (< (mod v_~x2~0_62 4294967296) .cse0)) (< (mod v_~x2~0_63 4294967296) .cse0) (= |v_thread2Thread1of1ForFork0_#res.offset_21| 0) (= |v_thread2Thread1of1ForFork0_#res.base_21| 0) (= (* v_~x2~0_63 2) v_~x2~0_62) (< (mod v_~x1~0_68 4294967296) .cse0))) InVars {~x2~0=v_~x2~0_63, ~n~0=v_~n~0_55, ~x1~0=v_~x1~0_68} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_21|, ~x2~0=v_~x2~0_62, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_21|, ~n~0=v_~n~0_55, ~x1~0=v_~x1~0_67} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, ~x2~0, thread2Thread1of1ForFork0_#res.base, ~x1~0] and [257] L65-4-->L38-1: Formula: (and (< (mod v_~x1~0_76 4294967296) (mod v_~n~0_61 4294967296)) (= (select (select |v_#memory_int_76| |v_ULTIMATE.start_main_~#t1~0#1.base_43|) |v_ULTIMATE.start_main_~#t1~0#1.offset_43|) |v_ULTIMATE.start_main_#t~mem8#1_36|) (= (* v_~x1~0_76 2) v_~x1~0_75)) InVars {#memory_int=|v_#memory_int_76|, ~n~0=v_~n~0_61, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ~x1~0=v_~x1~0_76, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_45|, ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_36|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_30|, #memory_int=|v_#memory_int_76|, ~n~0=v_~n~0_61, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_43|, ~x1~0=v_~x1~0_75, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_43|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~nondet7#1, ~x1~0] [2022-12-06 04:59:55,802 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 04:59:55,803 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 836 [2022-12-06 04:59:55,803 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 165 flow [2022-12-06 04:59:55,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 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 04:59:55,804 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:55,804 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:55,810 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 04:59:56,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:56,004 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:56,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:56,005 INFO L85 PathProgramCache]: Analyzing trace with hash 1656246989, now seen corresponding path program 1 times [2022-12-06 04:59:56,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:56,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222607026] [2022-12-06 04:59:56,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:56,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:56,106 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 04:59:56,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:56,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222607026] [2022-12-06 04:59:56,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222607026] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:59:56,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:59:56,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:59:56,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808716886] [2022-12-06 04:59:56,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:59:56,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:59:56,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:59:56,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:59:56,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:59:56,108 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 04:59:56,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states 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 04:59:56,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:59:56,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 04:59:56,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:59:56,269 INFO L130 PetriNetUnfolder]: 42/80 cut-off events. [2022-12-06 04:59:56,270 INFO L131 PetriNetUnfolder]: For 191/191 co-relation queries the response was YES. [2022-12-06 04:59:56,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 80 events. 42/80 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 172 event pairs, 8 based on Foata normal form. 4/80 useless extension candidates. Maximal degree in co-relation 337. Up to 53 conditions per place. [2022-12-06 04:59:56,271 INFO L137 encePairwiseOnDemand]: 12/19 looper letters, 20 selfloop transitions, 4 changer transitions 3/27 dead transitions. [2022-12-06 04:59:56,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 27 transitions, 221 flow [2022-12-06 04:59:56,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:59:56,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:59:56,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-12-06 04:59:56,272 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49122807017543857 [2022-12-06 04:59:56,272 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 165 flow. Second operand 3 states and 28 transitions. [2022-12-06 04:59:56,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 27 transitions, 221 flow [2022-12-06 04:59:56,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 204 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 04:59:56,273 INFO L231 Difference]: Finished difference. Result has 30 places, 19 transitions, 123 flow [2022-12-06 04:59:56,273 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=30, PETRI_TRANSITIONS=19} [2022-12-06 04:59:56,274 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 12 predicate places. [2022-12-06 04:59:56,274 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:59:56,274 INFO L89 Accepts]: Start accepts. Operand has 30 places, 19 transitions, 123 flow [2022-12-06 04:59:56,275 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:59:56,275 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:59:56,275 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 19 transitions, 123 flow [2022-12-06 04:59:56,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 19 transitions, 123 flow [2022-12-06 04:59:56,279 INFO L130 PetriNetUnfolder]: 14/43 cut-off events. [2022-12-06 04:59:56,279 INFO L131 PetriNetUnfolder]: For 39/40 co-relation queries the response was YES. [2022-12-06 04:59:56,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 43 events. 14/43 cut-off events. For 39/40 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 99 event pairs, 5 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 88. Up to 16 conditions per place. [2022-12-06 04:59:56,280 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 19 transitions, 123 flow [2022-12-06 04:59:56,280 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-06 04:59:56,281 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:59:56,281 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 04:59:56,281 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 123 flow [2022-12-06 04:59:56,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states 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 04:59:56,282 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:59:56,282 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:59:56,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 04:59:56,282 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 04:59:56,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:59:56,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1552780753, now seen corresponding path program 1 times [2022-12-06 04:59:56,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:59:56,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102363056] [2022-12-06 04:59:56,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:56,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:59:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:59:56,445 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 04:59:56,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:59:56,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102363056] [2022-12-06 04:59:56,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102363056] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 04:59:56,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341548702] [2022-12-06 04:59:56,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:59:56,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 04:59:56,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:59:56,452 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 04:59:56,475 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 05:00:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:00:14,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-06 05:00:14,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:00:41,715 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (mod c_~x2~0 4294967296)) (.cse7 (div c_~x2~0 4))) (let ((.cse6 (mod .cse7 2147483648)) (.cse1 (- .cse5))) (let ((.cse0 (* (div (+ (- 1) .cse1) 4294967296) 4294967296)) (.cse4 (* (div .cse6 2147483648) 4294967296)) (.cse3 (mod c_~x1~0 4294967296)) (.cse2 (mod .cse7 4294967296))) (and (<= (+ .cse0 4294967297 (* 4294967296 (div (+ .cse1 4294967295) 4294967296)) .cse2) .cse3) (<= (+ .cse0 4294967297 .cse4 .cse2) .cse5) (<= (+ (* 2 .cse6) 4294967297 .cse4 (* 4294967296 (div (+ (- 4294967295) .cse2) 4294967296))) .cse3) (= (mod c_~x1~0 2) 0) (= (mod c_~x2~0 4) 0) (= (mod (div c_~x1~0 2) 4294967296) .cse2))))) is different from false [2022-12-06 05:00:50,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:00:50,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:01:09,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:09,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341548702] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:01:09,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:01:09,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 12 [2022-12-06 05:01:09,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890490127] [2022-12-06 05:01:09,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:01:09,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:01:09,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:09,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:01:09,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=94, Unknown=5, NotChecked=20, Total=156 [2022-12-06 05:01:09,506 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 05:01:09,506 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 123 flow. Second operand has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:09,506 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:09,506 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 05:01:09,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:12,038 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 05:01:14,052 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 05:01:16,078 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 05:01:18,083 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 05:01:20,089 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 05:01:22,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:01:24,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:01:26,161 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 05:01:28,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:01:31,017 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 05:01:35,053 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 05:01:37,062 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 05:01:39,071 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 05:01:41,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:01:43,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:01:45,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:01:47,677 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 05:01:50,227 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 05:01:55,545 INFO L130 PetriNetUnfolder]: 90/179 cut-off events. [2022-12-06 05:01:55,545 INFO L131 PetriNetUnfolder]: For 357/357 co-relation queries the response was YES. [2022-12-06 05:01:55,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 179 events. 90/179 cut-off events. For 357/357 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 607 event pairs, 3 based on Foata normal form. 10/189 useless extension candidates. Maximal degree in co-relation 274. Up to 72 conditions per place. [2022-12-06 05:01:55,547 INFO L137 encePairwiseOnDemand]: 7/16 looper letters, 47 selfloop transitions, 23 changer transitions 2/72 dead transitions. [2022-12-06 05:01:55,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 72 transitions, 549 flow [2022-12-06 05:01:55,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 05:01:55,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 05:01:55,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-12-06 05:01:55,550 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.390625 [2022-12-06 05:01:55,550 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 123 flow. Second operand 12 states and 75 transitions. [2022-12-06 05:01:55,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 72 transitions, 549 flow [2022-12-06 05:01:55,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 72 transitions, 501 flow, removed 20 selfloop flow, removed 3 redundant places. [2022-12-06 05:01:55,553 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 304 flow [2022-12-06 05:01:55,553 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=304, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2022-12-06 05:01:55,554 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 24 predicate places. [2022-12-06 05:01:55,554 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:55,554 INFO L89 Accepts]: Start accepts. Operand has 42 places, 36 transitions, 304 flow [2022-12-06 05:01:55,555 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:55,555 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:55,555 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 36 transitions, 304 flow [2022-12-06 05:01:55,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 304 flow [2022-12-06 05:01:55,563 INFO L130 PetriNetUnfolder]: 29/96 cut-off events. [2022-12-06 05:01:55,563 INFO L131 PetriNetUnfolder]: For 369/370 co-relation queries the response was YES. [2022-12-06 05:01:55,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 96 events. 29/96 cut-off events. For 369/370 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 373 event pairs, 9 based on Foata normal form. 1/89 useless extension candidates. Maximal degree in co-relation 247. Up to 31 conditions per place. [2022-12-06 05:01:55,564 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 36 transitions, 304 flow [2022-12-06 05:01:55,564 INFO L188 LiptonReduction]: Number of co-enabled transitions 86 [2022-12-06 05:01:55,568 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [250] L46-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork0_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork0_#res.offset_Out_4| 0) (not (< (mod v_~x2~0_In_5 4294967296) (mod v_~n~0_In_1 4294967296)))) InVars {~n~0=v_~n~0_In_1, ~x2~0=v_~x2~0_In_5} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_Out_4|, ~x2~0=v_~x2~0_In_5, ~n~0=v_~n~0_In_1, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base] and [246] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_52 4294967296) (mod v_~n~0_47 4294967296)) (= v_~x1~0_51 (* v_~x1~0_52 2))) InVars {~n~0=v_~n~0_47, ~x1~0=v_~x1~0_52} OutVars{~n~0=v_~n~0_47, ~x1~0=v_~x1~0_51} AuxVars[] AssignedVars[~x1~0] [2022-12-06 05:01:55,701 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [224] L46-1-->L46-1: Formula: (and (< (mod v_~x2~0_22 4294967296) (mod v_~n~0_19 4294967296)) (= (* v_~x2~0_22 2) v_~x2~0_21)) InVars {~x2~0=v_~x2~0_22, ~n~0=v_~n~0_19} OutVars{~x2~0=v_~x2~0_21, ~n~0=v_~n~0_19} AuxVars[] AssignedVars[~x2~0] and [246] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_52 4294967296) (mod v_~n~0_47 4294967296)) (= v_~x1~0_51 (* v_~x1~0_52 2))) InVars {~n~0=v_~n~0_47, ~x1~0=v_~x1~0_52} OutVars{~n~0=v_~n~0_47, ~x1~0=v_~x1~0_51} AuxVars[] AssignedVars[~x1~0] [2022-12-06 05:01:55,784 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [246] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_52 4294967296) (mod v_~n~0_47 4294967296)) (= v_~x1~0_51 (* v_~x1~0_52 2))) InVars {~n~0=v_~n~0_47, ~x1~0=v_~x1~0_52} OutVars{~n~0=v_~n~0_47, ~x1~0=v_~x1~0_51} AuxVars[] AssignedVars[~x1~0] and [224] L46-1-->L46-1: Formula: (and (< (mod v_~x2~0_22 4294967296) (mod v_~n~0_19 4294967296)) (= (* v_~x2~0_22 2) v_~x2~0_21)) InVars {~x2~0=v_~x2~0_22, ~n~0=v_~n~0_19} OutVars{~x2~0=v_~x2~0_21, ~n~0=v_~n~0_19} AuxVars[] AssignedVars[~x2~0] [2022-12-06 05:01:56,074 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [256] L46-1-->L46-1: Formula: (let ((.cse0 (mod v_~n~0_59 4294967296))) (and (= (* v_~x2~0_72 4) v_~x2~0_70) (< (* (mod v_~x2~0_72 2147483648) 2) .cse0) (< (mod v_~x2~0_72 4294967296) .cse0))) InVars {~x2~0=v_~x2~0_72, ~n~0=v_~n~0_59} OutVars{~x2~0=v_~x2~0_70, ~n~0=v_~n~0_59} AuxVars[] AssignedVars[~x2~0] and [246] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_52 4294967296) (mod v_~n~0_47 4294967296)) (= v_~x1~0_51 (* v_~x1~0_52 2))) InVars {~n~0=v_~n~0_47, ~x1~0=v_~x1~0_52} OutVars{~n~0=v_~n~0_47, ~x1~0=v_~x1~0_51} AuxVars[] AssignedVars[~x1~0] [2022-12-06 05:01:56,687 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [221] L66-2-->L67-1: Formula: (= (select (select |v_#memory_int_33| |v_ULTIMATE.start_main_~#t2~0#1.base_15|) |v_ULTIMATE.start_main_~#t2~0#1.offset_15|) |v_ULTIMATE.start_main_#t~mem9#1_14|) InVars {ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, #memory_int=|v_#memory_int_33|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} OutVars{ULTIMATE.start_main_#t~mem8#1=|v_ULTIMATE.start_main_#t~mem8#1_14|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_15|, #memory_int=|v_#memory_int_33|, ULTIMATE.start_main_#t~mem9#1=|v_ULTIMATE.start_main_#t~mem9#1_14|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~mem9#1] and [224] L46-1-->L46-1: Formula: (and (< (mod v_~x2~0_22 4294967296) (mod v_~n~0_19 4294967296)) (= (* v_~x2~0_22 2) v_~x2~0_21)) InVars {~x2~0=v_~x2~0_22, ~n~0=v_~n~0_19} OutVars{~x2~0=v_~x2~0_21, ~n~0=v_~n~0_19} AuxVars[] AssignedVars[~x2~0] [2022-12-06 05:01:56,708 INFO L203 LiptonReduction]: Total number of compositions: 6 [2022-12-06 05:01:56,708 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1154 [2022-12-06 05:01:56,709 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 325 flow [2022-12-06 05:01:56,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:56,709 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:56,709 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:56,723 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 05:01:56,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:56,919 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:01:56,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:56,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1942538499, now seen corresponding path program 1 times [2022-12-06 05:01:56,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:56,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650575213] [2022-12-06 05:01:56,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:56,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:57,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:57,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:57,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650575213] [2022-12-06 05:01:57,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650575213] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:01:57,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:01:57,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:01:57,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554018917] [2022-12-06 05:01:57,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:01:57,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:01:57,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:01:57,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:01:57,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:01:57,192 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 26 [2022-12-06 05:01:57,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 325 flow. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:57,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:01:57,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 26 [2022-12-06 05:01:57,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:01:58,188 INFO L130 PetriNetUnfolder]: 95/186 cut-off events. [2022-12-06 05:01:58,188 INFO L131 PetriNetUnfolder]: For 864/864 co-relation queries the response was YES. [2022-12-06 05:01:58,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1044 conditions, 186 events. 95/186 cut-off events. For 864/864 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 639 event pairs, 16 based on Foata normal form. 1/181 useless extension candidates. Maximal degree in co-relation 597. Up to 140 conditions per place. [2022-12-06 05:01:58,190 INFO L137 encePairwiseOnDemand]: 15/26 looper letters, 29 selfloop transitions, 10 changer transitions 2/41 dead transitions. [2022-12-06 05:01:58,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 465 flow [2022-12-06 05:01:58,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:01:58,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:01:58,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-12-06 05:01:58,191 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44871794871794873 [2022-12-06 05:01:58,191 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 325 flow. Second operand 3 states and 35 transitions. [2022-12-06 05:01:58,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 465 flow [2022-12-06 05:01:58,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 41 transitions, 373 flow, removed 34 selfloop flow, removed 4 redundant places. [2022-12-06 05:01:58,194 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 280 flow [2022-12-06 05:01:58,195 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2022-12-06 05:01:58,195 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 20 predicate places. [2022-12-06 05:01:58,195 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:01:58,195 INFO L89 Accepts]: Start accepts. Operand has 38 places, 34 transitions, 280 flow [2022-12-06 05:01:58,196 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:01:58,196 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:01:58,196 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 34 transitions, 280 flow [2022-12-06 05:01:58,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 34 transitions, 280 flow [2022-12-06 05:01:58,204 INFO L130 PetriNetUnfolder]: 32/101 cut-off events. [2022-12-06 05:01:58,205 INFO L131 PetriNetUnfolder]: For 310/312 co-relation queries the response was YES. [2022-12-06 05:01:58,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 101 events. 32/101 cut-off events. For 310/312 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 408 event pairs, 10 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 275. Up to 35 conditions per place. [2022-12-06 05:01:58,206 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 34 transitions, 280 flow [2022-12-06 05:01:58,206 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-06 05:01:58,206 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [255] L46-1-->L38-1: Formula: (let ((.cse0 (mod v_~n~0_57 4294967296))) (and (= v_~x1~0_71 (* v_~x1~0_72 2)) (< (mod v_~x1~0_72 4294967296) .cse0) (< (mod v_~x2~0_67 4294967296) .cse0) (= v_~x2~0_66 (* v_~x2~0_67 2)))) InVars {~x2~0=v_~x2~0_67, ~n~0=v_~n~0_57, ~x1~0=v_~x1~0_72} OutVars{~x2~0=v_~x2~0_66, ~n~0=v_~n~0_57, ~x1~0=v_~x1~0_71} AuxVars[] AssignedVars[~x2~0, ~x1~0] and [262] L46-1-->L38-1: Formula: (let ((.cse0 (mod v_~n~0_71 4294967296))) (and (= v_~x1~0_97 (* v_~x1~0_98 2)) (= (* v_~x2~0_93 2) v_~x2~0_92) (< (mod v_~x1~0_98 4294967296) .cse0) (< (mod v_~x2~0_93 4294967296) .cse0))) InVars {~x2~0=v_~x2~0_93, ~n~0=v_~n~0_71, ~x1~0=v_~x1~0_98} OutVars{~x2~0=v_~x2~0_92, ~n~0=v_~n~0_71, ~x1~0=v_~x1~0_97} AuxVars[] AssignedVars[~x2~0, ~x1~0] [2022-12-06 05:01:58,332 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [246] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_52 4294967296) (mod v_~n~0_47 4294967296)) (= v_~x1~0_51 (* v_~x1~0_52 2))) InVars {~n~0=v_~n~0_47, ~x1~0=v_~x1~0_52} OutVars{~n~0=v_~n~0_47, ~x1~0=v_~x1~0_51} AuxVars[] AssignedVars[~x1~0] and [260] L46-1-->L38-1: Formula: (let ((.cse0 (mod v_~n~0_67 4294967296))) (and (= |v_thread2Thread1of1ForFork0_#res.offset_29| 0) (not (< (mod v_~x2~0_86 4294967296) .cse0)) (= |v_thread2Thread1of1ForFork0_#res.base_29| 0) (< (mod v_~x1~0_94 4294967296) .cse0) (= v_~x1~0_93 (* v_~x1~0_94 2)))) InVars {~x2~0=v_~x2~0_86, ~n~0=v_~n~0_67, ~x1~0=v_~x1~0_94} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_29|, ~x2~0=v_~x2~0_86, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_29|, ~n~0=v_~n~0_67, ~x1~0=v_~x1~0_93} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_#res.base, ~x1~0] [2022-12-06 05:01:58,388 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:01:58,388 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 193 [2022-12-06 05:01:58,388 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 292 flow [2022-12-06 05:01:58,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:01:58,389 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:01:58,389 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:01:58,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:01:58,389 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:01:58,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:01:58,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1258058676, now seen corresponding path program 1 times [2022-12-06 05:01:58,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:01:58,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344630875] [2022-12-06 05:01:58,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:58,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:01:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:01:58,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:01:58,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:01:58,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344630875] [2022-12-06 05:01:58,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344630875] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:01:58,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837309055] [2022-12-06 05:01:58,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:01:58,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:01:58,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:01:58,488 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 05:01:58,490 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 05:02:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:02:40,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 05:02:40,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:02:54,496 WARN L233 SmtUtils]: Spent 5.19s on a formula simplification. DAG size of input: 6 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-12-06 05:02:54,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:02:54,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:03:01,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:03:01,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837309055] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:03:01,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:03:01,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 05:03:01,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685384238] [2022-12-06 05:03:01,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:03:01,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-06 05:03:01,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:03:01,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-06 05:03:01,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=68, Unknown=1, NotChecked=0, Total=110 [2022-12-06 05:03:01,715 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-06 05:03:01,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 292 flow. Second operand has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:03:01,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:03:01,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-06 05:03:01,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:03:03,752 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 05:03:05,756 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 05:03:08,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:10,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:12,086 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 05:03:14,096 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 05:03:16,100 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 05:03:18,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:20,561 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 05:03:22,567 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 05:03:24,580 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 05:03:26,586 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 05:03:28,593 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 05:03:33,314 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 05:03:36,628 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 05:03:39,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:41,183 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 05:03:43,192 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 05:03:44,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:46,447 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 05:03:48,714 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 05:03:51,077 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 05:03:53,194 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 05:03:55,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:56,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:03:59,218 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 05:04:01,222 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 05:04:03,225 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 05:04:05,231 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 05:04:07,235 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 05:04:09,239 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 05:04:09,709 INFO L130 PetriNetUnfolder]: 110/209 cut-off events. [2022-12-06 05:04:09,710 INFO L131 PetriNetUnfolder]: For 788/788 co-relation queries the response was YES. [2022-12-06 05:04:09,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1100 conditions, 209 events. 110/209 cut-off events. For 788/788 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 731 event pairs, 3 based on Foata normal form. 12/219 useless extension candidates. Maximal degree in co-relation 574. Up to 74 conditions per place. [2022-12-06 05:04:09,711 INFO L137 encePairwiseOnDemand]: 8/25 looper letters, 35 selfloop transitions, 28 changer transitions 11/74 dead transitions. [2022-12-06 05:04:09,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 74 transitions, 734 flow [2022-12-06 05:04:09,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 05:04:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 05:04:09,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 71 transitions. [2022-12-06 05:04:09,713 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.284 [2022-12-06 05:04:09,713 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 292 flow. Second operand 10 states and 71 transitions. [2022-12-06 05:04:09,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 74 transitions, 734 flow [2022-12-06 05:04:09,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 74 transitions, 670 flow, removed 20 selfloop flow, removed 2 redundant places. [2022-12-06 05:04:09,716 INFO L231 Difference]: Finished difference. Result has 48 places, 44 transitions, 421 flow [2022-12-06 05:04:09,717 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=421, PETRI_PLACES=48, PETRI_TRANSITIONS=44} [2022-12-06 05:04:09,717 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 30 predicate places. [2022-12-06 05:04:09,717 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:04:09,717 INFO L89 Accepts]: Start accepts. Operand has 48 places, 44 transitions, 421 flow [2022-12-06 05:04:09,718 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:04:09,718 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:09,718 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 44 transitions, 421 flow [2022-12-06 05:04:09,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 44 transitions, 421 flow [2022-12-06 05:04:09,727 INFO L130 PetriNetUnfolder]: 35/98 cut-off events. [2022-12-06 05:04:09,727 INFO L131 PetriNetUnfolder]: For 592/594 co-relation queries the response was YES. [2022-12-06 05:04:09,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 98 events. 35/98 cut-off events. For 592/594 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 353 event pairs, 10 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 463. Up to 34 conditions per place. [2022-12-06 05:04:09,728 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 44 transitions, 421 flow [2022-12-06 05:04:09,728 INFO L188 LiptonReduction]: Number of co-enabled transitions 100 [2022-12-06 05:04:09,729 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [255] L46-1-->L38-1: Formula: (let ((.cse0 (mod v_~n~0_57 4294967296))) (and (= v_~x1~0_71 (* v_~x1~0_72 2)) (< (mod v_~x1~0_72 4294967296) .cse0) (< (mod v_~x2~0_67 4294967296) .cse0) (= v_~x2~0_66 (* v_~x2~0_67 2)))) InVars {~x2~0=v_~x2~0_67, ~n~0=v_~n~0_57, ~x1~0=v_~x1~0_72} OutVars{~x2~0=v_~x2~0_66, ~n~0=v_~n~0_57, ~x1~0=v_~x1~0_71} AuxVars[] AssignedVars[~x2~0, ~x1~0] and [261] L46-1-->thread2EXIT: Formula: (let ((.cse0 (mod v_~n~0_69 4294967296))) (and (= (* v_~x2~0_89 2) v_~x2~0_88) (= |v_thread2Thread1of1ForFork0_#res.offset_31| 0) (= |v_thread2Thread1of1ForFork0_#res.base_31| 0) (< (mod v_~x2~0_89 4294967296) .cse0) (not (< (mod v_~x2~0_88 4294967296) .cse0)))) InVars {~x2~0=v_~x2~0_89, ~n~0=v_~n~0_69} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_31|, ~x2~0=v_~x2~0_88, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_31|, ~n~0=v_~n~0_69} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, ~x2~0, thread2Thread1of1ForFork0_#res.base] [2022-12-06 05:04:09,977 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [255] L46-1-->L38-1: Formula: (let ((.cse0 (mod v_~n~0_57 4294967296))) (and (= v_~x1~0_71 (* v_~x1~0_72 2)) (< (mod v_~x1~0_72 4294967296) .cse0) (< (mod v_~x2~0_67 4294967296) .cse0) (= v_~x2~0_66 (* v_~x2~0_67 2)))) InVars {~x2~0=v_~x2~0_67, ~n~0=v_~n~0_57, ~x1~0=v_~x1~0_72} OutVars{~x2~0=v_~x2~0_66, ~n~0=v_~n~0_57, ~x1~0=v_~x1~0_71} AuxVars[] AssignedVars[~x2~0, ~x1~0] and [263] L46-1-->L46-1: Formula: (let ((.cse0 (mod v_~n~0_73 4294967296))) (and (< (mod v_~x2~0_98 4294967296) .cse0) (= v_~x2~0_96 (* v_~x2~0_98 4)) (< (* (mod v_~x2~0_98 2147483648) 2) .cse0))) InVars {~x2~0=v_~x2~0_98, ~n~0=v_~n~0_73} OutVars{~x2~0=v_~x2~0_96, ~n~0=v_~n~0_73} AuxVars[] AssignedVars[~x2~0] [2022-12-06 05:04:10,428 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [274] L46-1-->thread2EXIT: Formula: (let ((.cse0 (mod v_~n~0_95 4294967296))) (and (= v_~x1~0_145 (* v_~x1~0_146 2)) (not (< (mod v_~x2~0_146 4294967296) .cse0)) (= (* v_~x2~0_148 4) v_~x2~0_146) (< (* 2 (mod v_~x2~0_148 2147483648)) .cse0) (= |v_thread2Thread1of1ForFork0_#res.offset_41| 0) (= |v_thread2Thread1of1ForFork0_#res.base_41| 0) (< (mod v_~x2~0_148 4294967296) .cse0) (< (mod v_~x1~0_146 4294967296) .cse0))) InVars {~x2~0=v_~x2~0_148, ~n~0=v_~n~0_95, ~x1~0=v_~x1~0_146} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_41|, ~x2~0=v_~x2~0_146, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_41|, ~n~0=v_~n~0_95, ~x1~0=v_~x1~0_145} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, ~x2~0, thread2Thread1of1ForFork0_#res.base, ~x1~0] and [246] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_52 4294967296) (mod v_~n~0_47 4294967296)) (= v_~x1~0_51 (* v_~x1~0_52 2))) InVars {~n~0=v_~n~0_47, ~x1~0=v_~x1~0_52} OutVars{~n~0=v_~n~0_47, ~x1~0=v_~x1~0_51} AuxVars[] AssignedVars[~x1~0] [2022-12-06 05:04:12,538 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [268] L46-1-->L46-1: Formula: (let ((.cse0 (mod v_~n~0_83 4294967296))) (and (< (mod v_~x2~0_116 4294967296) .cse0) (< (* (mod v_~x2~0_116 2147483648) 2) .cse0) (= v_~x2~0_114 (* v_~x2~0_116 8)) (< (* (mod v_~x2~0_116 1073741824) 4) .cse0))) InVars {~x2~0=v_~x2~0_116, ~n~0=v_~n~0_83} OutVars{~x2~0=v_~x2~0_114, ~n~0=v_~n~0_83} AuxVars[] AssignedVars[~x2~0] and [246] L38-1-->L38-1: Formula: (and (< (mod v_~x1~0_52 4294967296) (mod v_~n~0_47 4294967296)) (= v_~x1~0_51 (* v_~x1~0_52 2))) InVars {~n~0=v_~n~0_47, ~x1~0=v_~x1~0_52} OutVars{~n~0=v_~n~0_47, ~x1~0=v_~x1~0_51} AuxVars[] AssignedVars[~x1~0] [2022-12-06 05:04:12,682 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [282] L46-1-->thread1EXIT: Formula: (let ((.cse0 (mod v_~n~0_111 4294967296))) (and (= |v_thread1Thread1of1ForFork1_#res.base_21| 0) (< (mod v_~x1~0_186 4294967296) .cse0) (< (mod v_~x2~0_183 4294967296) .cse0) (= v_~x2~0_182 (* 2 v_~x2~0_183)) (not (< (mod v_~x1~0_185 4294967296) .cse0)) (= |v_thread1Thread1of1ForFork1_#res.offset_21| 0) (= (* v_~x1~0_186 2) v_~x1~0_185))) InVars {~x2~0=v_~x2~0_183, ~n~0=v_~n~0_111, ~x1~0=v_~x1~0_186} OutVars{~x2~0=v_~x2~0_182, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_21|, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_21|, ~n~0=v_~n~0_111, ~x1~0=v_~x1~0_185} AuxVars[] AssignedVars[~x2~0, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset, ~x1~0] and [263] L46-1-->L46-1: Formula: (let ((.cse0 (mod v_~n~0_73 4294967296))) (and (< (mod v_~x2~0_98 4294967296) .cse0) (= v_~x2~0_96 (* v_~x2~0_98 4)) (< (* (mod v_~x2~0_98 2147483648) 2) .cse0))) InVars {~x2~0=v_~x2~0_98, ~n~0=v_~n~0_73} OutVars{~x2~0=v_~x2~0_96, ~n~0=v_~n~0_73} AuxVars[] AssignedVars[~x2~0] [2022-12-06 05:04:12,961 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:04:12,962 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3245 [2022-12-06 05:04:12,962 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 457 flow [2022-12-06 05:04:12,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.0) internal successors, (33), 10 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:12,962 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:04:12,962 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:04:12,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 05:04:13,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:04:13,168 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:04:13,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:04:13,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1685797257, now seen corresponding path program 1 times [2022-12-06 05:04:13,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:04:13,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140335351] [2022-12-06 05:04:13,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:04:13,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:04:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:04:13,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:04:13,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:04:13,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140335351] [2022-12-06 05:04:13,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140335351] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:04:13,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:04:13,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:04:13,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168466228] [2022-12-06 05:04:13,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:04:13,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:04:13,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:04:13,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:04:13,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:04:13,280 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 05:04:13,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 457 flow. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:04:13,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:04:13,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 05:04:13,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:04:15,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 05:04:18,006 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 05:04:20,024 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 05:04:22,039 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 05:04:22,516 INFO L130 PetriNetUnfolder]: 87/151 cut-off events. [2022-12-06 05:04:22,517 INFO L131 PetriNetUnfolder]: For 1033/1033 co-relation queries the response was YES. [2022-12-06 05:04:22,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 151 events. 87/151 cut-off events. For 1033/1033 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 431 event pairs, 5 based on Foata normal form. 10/153 useless extension candidates. Maximal degree in co-relation 889. Up to 107 conditions per place. [2022-12-06 05:04:22,518 INFO L137 encePairwiseOnDemand]: 11/28 looper letters, 26 selfloop transitions, 17 changer transitions 1/44 dead transitions. [2022-12-06 05:04:22,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 44 transitions, 517 flow [2022-12-06 05:04:22,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:04:22,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:04:22,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 05:04:22,519 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2022-12-06 05:04:22,520 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 457 flow. Second operand 4 states and 36 transitions. [2022-12-06 05:04:22,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 44 transitions, 517 flow [2022-12-06 05:04:22,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 408 flow, removed 41 selfloop flow, removed 5 redundant places. [2022-12-06 05:04:22,523 INFO L231 Difference]: Finished difference. Result has 44 places, 39 transitions, 337 flow [2022-12-06 05:04:22,523 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=337, PETRI_PLACES=44, PETRI_TRANSITIONS=39} [2022-12-06 05:04:22,524 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 26 predicate places. [2022-12-06 05:04:22,524 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:04:22,524 INFO L89 Accepts]: Start accepts. Operand has 44 places, 39 transitions, 337 flow [2022-12-06 05:04:22,524 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:04:22,525 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:04:22,525 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 39 transitions, 337 flow [2022-12-06 05:04:22,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 39 transitions, 337 flow [2022-12-06 05:04:22,531 INFO L130 PetriNetUnfolder]: 31/79 cut-off events. [2022-12-06 05:04:22,531 INFO L131 PetriNetUnfolder]: For 534/541 co-relation queries the response was YES. [2022-12-06 05:04:22,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 79 events. 31/79 cut-off events. For 534/541 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 252 event pairs, 7 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 287. Up to 25 conditions per place. [2022-12-06 05:04:22,532 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 39 transitions, 337 flow [2022-12-06 05:04:22,532 INFO L188 LiptonReduction]: Number of co-enabled transitions 90 [2022-12-06 05:04:22,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 05:04:22,535 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IndexOutOfBoundsException: Index 11 out of bounds for length 11 at java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) at java.base/jdk.internal.util.Preconditions.outOfBoundsCheckIndex(Preconditions.java:70) at java.base/jdk.internal.util.Preconditions.checkIndex(Preconditions.java:248) at java.base/java.util.Objects.checkIndex(Objects.java:372) at java.base/java.util.ArrayList.get(ArrayList.java:459) at de.uni_freiburg.informatik.ultimate.automata.petrinet.PetriNetRun.getTransition(PetriNetRun.java:125) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.adaptRun(ChoiceRule.java:163) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ChoiceRule.applyInternal(ChoiceRule.java:115) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.choiceRuleWrapper(LiptonReduction.java:239) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:200) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 05:04:22,538 INFO L158 Benchmark]: Toolchain (without parser) took 296311.02ms. Allocated memory was 177.2MB in the beginning and 248.5MB in the end (delta: 71.3MB). Free memory was 150.8MB in the beginning and 89.0MB in the end (delta: 61.8MB). Peak memory consumption was 134.0MB. Max. memory is 8.0GB. [2022-12-06 05:04:22,538 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 177.2MB. Free memory was 154.3MB in the beginning and 154.3MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:04:22,538 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.33ms. Allocated memory is still 177.2MB. Free memory was 150.8MB in the beginning and 140.2MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-12-06 05:04:22,538 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.95ms. Allocated memory is still 177.2MB. Free memory was 140.2MB in the beginning and 138.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:04:22,538 INFO L158 Benchmark]: Boogie Preprocessor took 18.28ms. Allocated memory is still 177.2MB. Free memory was 138.7MB in the beginning and 137.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:04:22,539 INFO L158 Benchmark]: RCFGBuilder took 358.18ms. Allocated memory is still 177.2MB. Free memory was 137.2MB in the beginning and 125.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:04:22,539 INFO L158 Benchmark]: TraceAbstraction took 295693.57ms. Allocated memory was 177.2MB in the beginning and 248.5MB in the end (delta: 71.3MB). Free memory was 125.0MB in the beginning and 89.0MB in the end (delta: 36.0MB). Peak memory consumption was 108.9MB. Max. memory is 8.0GB. [2022-12-06 05:04:22,540 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 177.2MB. Free memory was 154.3MB in the beginning and 154.3MB in the end (delta: 70.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 206.33ms. Allocated memory is still 177.2MB. Free memory was 150.8MB in the beginning and 140.2MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.95ms. Allocated memory is still 177.2MB. Free memory was 140.2MB in the beginning and 138.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 18.28ms. Allocated memory is still 177.2MB. Free memory was 138.7MB in the beginning and 137.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 358.18ms. Allocated memory is still 177.2MB. Free memory was 137.2MB in the beginning and 125.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 295693.57ms. Allocated memory was 177.2MB in the beginning and 248.5MB in the end (delta: 71.3MB). Free memory was 125.0MB in the beginning and 89.0MB in the end (delta: 36.0MB). Peak memory consumption was 108.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 65 PlacesBefore, 18 PlacesAfterwards, 64 TransitionsBefore, 13 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 13 ConcurrentYvCompositions, 4 ChoiceCompositions, 51 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 128, independent: 128, independent conditional: 128, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 128, independent: 128, independent conditional: 0, independent unconditional: 128, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 128, independent: 128, independent conditional: 0, independent unconditional: 128, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 128, independent: 128, independent conditional: 0, independent unconditional: 128, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 128, independent: 128, independent conditional: 0, independent unconditional: 128, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 128, independent: 128, independent conditional: 0, independent unconditional: 128, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 128, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 128, unknown conditional: 0, unknown unconditional: 128] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 205, Positive conditional cache size: 0, Positive unconditional cache size: 205, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 17 PlacesBefore, 17 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 21 PlacesBefore, 21 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 21 PlacesBefore, 21 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 25 PlacesBefore, 25 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 46 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 30 PlacesBefore, 29 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 52 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1, Positive cache size: 1, Positive conditional cache size: 1, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 24 PlacesBefore, 24 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 26 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1, Positive cache size: 1, Positive conditional cache size: 1, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.8s, 30 PlacesBefore, 29 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 28 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3, Positive cache size: 3, Positive conditional cache size: 3, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 28 PlacesBefore, 28 PlacesAfterwards, 19 TransitionsBefore, 19 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3, Positive cache size: 3, Positive conditional cache size: 3, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.1s, 42 PlacesBefore, 39 PlacesAfterwards, 36 TransitionsBefore, 33 TransitionsAfterwards, 86 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 21, independent conditional: 21, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 19, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 34, Positive cache size: 34, Positive conditional cache size: 34, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.2s, 37 PlacesBefore, 37 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 35, Positive cache size: 35, Positive conditional cache size: 35, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 47 PlacesBefore, 45 PlacesAfterwards, 44 TransitionsBefore, 42 TransitionsAfterwards, 100 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 11, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 40, Positive cache size: 40, Positive conditional cache size: 40, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - ExceptionOrErrorResult: IndexOutOfBoundsException: Index 11 out of bounds for length 11 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IndexOutOfBoundsException: Index 11 out of bounds for length 11: java.base/jdk.internal.util.Preconditions.outOfBounds(Preconditions.java:64) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 05:04:22,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...