/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/popl20-more-sorted.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:36:52,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:36:52,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:36:52,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:36:52,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:36:52,474 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:36:52,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:36:52,476 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:36:52,478 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:36:52,478 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:36:52,480 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:36:52,482 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:36:52,483 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:36:52,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:36:52,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:36:52,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:36:52,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:36:52,493 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:36:52,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:36:52,499 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:36:52,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:36:52,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:36:52,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:36:52,504 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:36:52,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:36:52,513 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:36:52,514 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:36:52,515 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:36:52,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:36:52,516 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:36:52,516 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:36:52,517 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:36:52,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:36:52,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:36:52,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:36:52,520 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:36:52,521 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:36:52,521 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:36:52,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:36:52,522 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:36:52,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:36:52,525 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:36:52,555 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:36:52,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:36:52,557 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:36:52,557 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:36:52,557 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:36:52,558 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:36:52,558 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:36:52,558 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:36:52,559 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:36:52,559 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:36:52,559 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:36:52,560 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:36:52,560 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:36:52,560 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:36:52,560 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:36:52,560 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:36:52,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:36:52,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:36:52,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:36:52,570 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:36:52,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:36:52,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:36:52,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:36:52,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:36:52,571 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:36:52,571 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:36:52,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:36:52,572 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:36:52,572 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:36:52,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:36:52,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:36:52,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:36:52,912 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:36:52,913 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:36:52,914 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c [2022-12-06 05:36:53,977 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:36:54,194 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:36:54,194 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sorted.wvr.c [2022-12-06 05:36:54,203 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/035d3ff01/421111f0c66744a29a8dbb38f88dc0a8/FLAG49ecfc25e [2022-12-06 05:36:54,217 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/035d3ff01/421111f0c66744a29a8dbb38f88dc0a8 [2022-12-06 05:36:54,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:36:54,220 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:36:54,221 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:36:54,221 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:36:54,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:36:54,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:36:54" (1/1) ... [2022-12-06 05:36:54,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@464e7a2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:54, skipping insertion in model container [2022-12-06 05:36:54,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:36:54" (1/1) ... [2022-12-06 05:36:54,230 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:36:54,245 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:36:54,374 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/popl20-more-sorted.wvr.c[2434,2447] [2022-12-06 05:36:54,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:36:54,392 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:36:54,430 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/popl20-more-sorted.wvr.c[2434,2447] [2022-12-06 05:36:54,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:36:54,448 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:36:54,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:54 WrapperNode [2022-12-06 05:36:54,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:36:54,451 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:36:54,451 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:36:54,452 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:36:54,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:54" (1/1) ... [2022-12-06 05:36:54,477 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:54" (1/1) ... [2022-12-06 05:36:54,504 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2022-12-06 05:36:54,504 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:36:54,505 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:36:54,505 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:36:54,505 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:36:54,512 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:54" (1/1) ... [2022-12-06 05:36:54,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:54" (1/1) ... [2022-12-06 05:36:54,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:54" (1/1) ... [2022-12-06 05:36:54,525 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:54" (1/1) ... [2022-12-06 05:36:54,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:54" (1/1) ... [2022-12-06 05:36:54,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:54" (1/1) ... [2022-12-06 05:36:54,534 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:54" (1/1) ... [2022-12-06 05:36:54,548 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:54" (1/1) ... [2022-12-06 05:36:54,550 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:36:54,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:36:54,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:36:54,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:36:54,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:54" (1/1) ... [2022-12-06 05:36:54,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:36:54,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:36:54,578 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:36:54,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:36:54,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:36:54,618 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:36:54,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:36:54,619 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:36:54,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:36:54,619 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:36:54,619 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:36:54,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:36:54,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:36:54,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:36:54,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:36:54,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:36:54,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:36:54,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:36:54,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:36:54,622 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:36:54,761 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:36:54,763 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:36:55,084 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:36:55,092 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:36:55,093 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-06 05:36:55,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:36:55 BoogieIcfgContainer [2022-12-06 05:36:55,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:36:55,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:36:55,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:36:55,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:36:55,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:36:54" (1/3) ... [2022-12-06 05:36:55,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276d4ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:36:55, skipping insertion in model container [2022-12-06 05:36:55,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:36:54" (2/3) ... [2022-12-06 05:36:55,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@276d4ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:36:55, skipping insertion in model container [2022-12-06 05:36:55,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:36:55" (3/3) ... [2022-12-06 05:36:55,115 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2022-12-06 05:36:55,134 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:36:55,134 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:36:55,134 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:36:55,262 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:36:55,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 172 transitions, 368 flow [2022-12-06 05:36:55,424 INFO L130 PetriNetUnfolder]: 15/169 cut-off events. [2022-12-06 05:36:55,424 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:36:55,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 169 events. 15/169 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 201 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2022-12-06 05:36:55,430 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 172 transitions, 368 flow [2022-12-06 05:36:55,439 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 159 transitions, 336 flow [2022-12-06 05:36:55,441 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:36:55,468 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 159 transitions, 336 flow [2022-12-06 05:36:55,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 159 transitions, 336 flow [2022-12-06 05:36:55,548 INFO L130 PetriNetUnfolder]: 15/159 cut-off events. [2022-12-06 05:36:55,549 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:36:55,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 159 events. 15/159 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 198 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 124. Up to 2 conditions per place. [2022-12-06 05:36:55,558 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 159 transitions, 336 flow [2022-12-06 05:36:55,558 INFO L188 LiptonReduction]: Number of co-enabled transitions 3534 [2022-12-06 05:37:01,688 INFO L203 LiptonReduction]: Total number of compositions: 131 [2022-12-06 05:37:01,700 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:37:01,705 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;@5975a43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:37:01,705 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:37:01,710 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2022-12-06 05:37:01,711 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:37:01,711 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:01,711 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:01,712 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:37:01,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:01,716 INFO L85 PathProgramCache]: Analyzing trace with hash 514205932, now seen corresponding path program 1 times [2022-12-06 05:37:01,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:01,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564519937] [2022-12-06 05:37:01,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:01,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:02,194 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:37:02,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:02,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564519937] [2022-12-06 05:37:02,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564519937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:02,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:02,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:37:02,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482184621] [2022-12-06 05:37:02,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:02,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:37:02,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:02,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:37:02,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:37:02,227 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 05:37:02,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:02,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:02,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 05:37:02,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:02,394 INFO L130 PetriNetUnfolder]: 562/733 cut-off events. [2022-12-06 05:37:02,395 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2022-12-06 05:37:02,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 733 events. 562/733 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2287 event pairs, 245 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 1283. Up to 728 conditions per place. [2022-12-06 05:37:02,409 INFO L137 encePairwiseOnDemand]: 25/28 looper letters, 25 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2022-12-06 05:37:02,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 29 transitions, 130 flow [2022-12-06 05:37:02,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:37:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:37:02,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-12-06 05:37:02,421 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.40476190476190477 [2022-12-06 05:37:02,423 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 74 flow. Second operand 3 states and 34 transitions. [2022-12-06 05:37:02,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 29 transitions, 130 flow [2022-12-06 05:37:02,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 29 transitions, 118 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 05:37:02,430 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 74 flow [2022-12-06 05:37:02,432 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2022-12-06 05:37:02,436 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2022-12-06 05:37:02,436 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:02,437 INFO L89 Accepts]: Start accepts. Operand has 29 places, 29 transitions, 74 flow [2022-12-06 05:37:02,440 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:02,440 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:02,441 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 29 transitions, 74 flow [2022-12-06 05:37:02,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 29 transitions, 74 flow [2022-12-06 05:37:02,454 INFO L130 PetriNetUnfolder]: 6/29 cut-off events. [2022-12-06 05:37:02,454 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:37:02,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 29 events. 6/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 32. Up to 4 conditions per place. [2022-12-06 05:37:02,456 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 29 transitions, 74 flow [2022-12-06 05:37:02,456 INFO L188 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-06 05:37:03,584 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:03,586 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1150 [2022-12-06 05:37:03,586 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 28 transitions, 70 flow [2022-12-06 05:37:03,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:03,586 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:03,586 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:03,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:37:03,587 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:37:03,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:03,588 INFO L85 PathProgramCache]: Analyzing trace with hash 226024399, now seen corresponding path program 1 times [2022-12-06 05:37:03,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:03,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839126349] [2022-12-06 05:37:03,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:03,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:03,977 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:37:03,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:03,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839126349] [2022-12-06 05:37:03,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839126349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:03,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:03,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:37:03,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520108965] [2022-12-06 05:37:03,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:03,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:37:03,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:03,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:37:03,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:37:03,989 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 05:37:03,989 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 28 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:03,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:03,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 05:37:03,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:04,127 INFO L130 PetriNetUnfolder]: 753/1007 cut-off events. [2022-12-06 05:37:04,127 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-06 05:37:04,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2040 conditions, 1007 events. 753/1007 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3521 event pairs, 95 based on Foata normal form. 1/586 useless extension candidates. Maximal degree in co-relation 2032. Up to 824 conditions per place. [2022-12-06 05:37:04,136 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 38 selfloop transitions, 4 changer transitions 1/46 dead transitions. [2022-12-06 05:37:04,136 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 46 transitions, 197 flow [2022-12-06 05:37:04,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:37:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:37:04,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-06 05:37:04,139 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6547619047619048 [2022-12-06 05:37:04,139 INFO L175 Difference]: Start difference. First operand has 28 places, 28 transitions, 70 flow. Second operand 3 states and 55 transitions. [2022-12-06 05:37:04,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 46 transitions, 197 flow [2022-12-06 05:37:04,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 46 transitions, 189 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:37:04,142 INFO L231 Difference]: Finished difference. Result has 29 places, 31 transitions, 92 flow [2022-12-06 05:37:04,142 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=29, PETRI_TRANSITIONS=31} [2022-12-06 05:37:04,142 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2022-12-06 05:37:04,142 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:04,143 INFO L89 Accepts]: Start accepts. Operand has 29 places, 31 transitions, 92 flow [2022-12-06 05:37:04,144 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:04,144 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:04,144 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 31 transitions, 92 flow [2022-12-06 05:37:04,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 31 transitions, 92 flow [2022-12-06 05:37:04,155 INFO L130 PetriNetUnfolder]: 38/89 cut-off events. [2022-12-06 05:37:04,156 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 05:37:04,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 89 events. 38/89 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 227 event pairs, 1 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 100. Up to 40 conditions per place. [2022-12-06 05:37:04,157 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 31 transitions, 92 flow [2022-12-06 05:37:04,157 INFO L188 LiptonReduction]: Number of co-enabled transitions 286 [2022-12-06 05:37:04,160 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:04,161 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 05:37:04,162 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 31 transitions, 92 flow [2022-12-06 05:37:04,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:04,162 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:04,162 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:04,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:37:04,163 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:37:04,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:04,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1992610771, now seen corresponding path program 1 times [2022-12-06 05:37:04,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:04,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619660225] [2022-12-06 05:37:04,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:04,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:04,396 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:37:04,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:04,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619660225] [2022-12-06 05:37:04,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619660225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:04,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:04,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:37:04,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644503786] [2022-12-06 05:37:04,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:04,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:37:04,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:04,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:37:04,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:37:04,402 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 05:37:04,402 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 31 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:04,402 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:04,402 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 05:37:04,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:04,734 INFO L130 PetriNetUnfolder]: 1451/1989 cut-off events. [2022-12-06 05:37:04,734 INFO L131 PetriNetUnfolder]: For 465/467 co-relation queries the response was YES. [2022-12-06 05:37:04,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4762 conditions, 1989 events. 1451/1989 cut-off events. For 465/467 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 8555 event pairs, 397 based on Foata normal form. 66/1679 useless extension candidates. Maximal degree in co-relation 499. Up to 758 conditions per place. [2022-12-06 05:37:04,747 INFO L137 encePairwiseOnDemand]: 22/28 looper letters, 80 selfloop transitions, 5 changer transitions 0/87 dead transitions. [2022-12-06 05:37:04,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 87 transitions, 431 flow [2022-12-06 05:37:04,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:37:04,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:37:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-12-06 05:37:04,749 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5297619047619048 [2022-12-06 05:37:04,749 INFO L175 Difference]: Start difference. First operand has 29 places, 31 transitions, 92 flow. Second operand 6 states and 89 transitions. [2022-12-06 05:37:04,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 87 transitions, 431 flow [2022-12-06 05:37:04,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 87 transitions, 420 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:37:04,751 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 129 flow [2022-12-06 05:37:04,751 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=129, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2022-12-06 05:37:04,752 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2022-12-06 05:37:04,752 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:04,752 INFO L89 Accepts]: Start accepts. Operand has 37 places, 35 transitions, 129 flow [2022-12-06 05:37:04,753 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:04,753 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:04,753 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 35 transitions, 129 flow [2022-12-06 05:37:04,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 35 transitions, 129 flow [2022-12-06 05:37:04,765 INFO L130 PetriNetUnfolder]: 51/138 cut-off events. [2022-12-06 05:37:04,766 INFO L131 PetriNetUnfolder]: For 9/11 co-relation queries the response was YES. [2022-12-06 05:37:04,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 138 events. 51/138 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 475 event pairs, 1 based on Foata normal form. 2/119 useless extension candidates. Maximal degree in co-relation 141. Up to 55 conditions per place. [2022-12-06 05:37:04,767 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 35 transitions, 129 flow [2022-12-06 05:37:04,767 INFO L188 LiptonReduction]: Number of co-enabled transitions 354 [2022-12-06 05:37:07,212 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:07,214 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2462 [2022-12-06 05:37:07,214 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 131 flow [2022-12-06 05:37:07,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:07,214 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:07,214 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:07,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:37:07,214 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:37:07,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:07,215 INFO L85 PathProgramCache]: Analyzing trace with hash 371131644, now seen corresponding path program 1 times [2022-12-06 05:37:07,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:07,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261785615] [2022-12-06 05:37:07,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:07,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:07,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:37:07,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:07,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261785615] [2022-12-06 05:37:07,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261785615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:07,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:07,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:37:07,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365511521] [2022-12-06 05:37:07,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:07,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:37:07,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:07,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:37:07,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:37:07,311 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 30 [2022-12-06 05:37:07,311 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 131 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:07,311 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:07,311 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 30 [2022-12-06 05:37:07,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:07,550 INFO L130 PetriNetUnfolder]: 1310/1836 cut-off events. [2022-12-06 05:37:07,551 INFO L131 PetriNetUnfolder]: For 831/888 co-relation queries the response was YES. [2022-12-06 05:37:07,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4803 conditions, 1836 events. 1310/1836 cut-off events. For 831/888 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 7931 event pairs, 500 based on Foata normal form. 52/1593 useless extension candidates. Maximal degree in co-relation 3026. Up to 735 conditions per place. [2022-12-06 05:37:07,563 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 65 selfloop transitions, 5 changer transitions 1/74 dead transitions. [2022-12-06 05:37:07,563 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 74 transitions, 394 flow [2022-12-06 05:37:07,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:37:07,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:37:07,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-06 05:37:07,566 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2022-12-06 05:37:07,566 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 131 flow. Second operand 4 states and 73 transitions. [2022-12-06 05:37:07,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 74 transitions, 394 flow [2022-12-06 05:37:07,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 74 transitions, 388 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-12-06 05:37:07,572 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 162 flow [2022-12-06 05:37:07,572 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2022-12-06 05:37:07,573 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2022-12-06 05:37:07,573 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:07,574 INFO L89 Accepts]: Start accepts. Operand has 42 places, 38 transitions, 162 flow [2022-12-06 05:37:07,575 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:07,575 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:07,575 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 38 transitions, 162 flow [2022-12-06 05:37:07,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 38 transitions, 162 flow [2022-12-06 05:37:07,589 INFO L130 PetriNetUnfolder]: 48/128 cut-off events. [2022-12-06 05:37:07,589 INFO L131 PetriNetUnfolder]: For 43/59 co-relation queries the response was YES. [2022-12-06 05:37:07,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 128 events. 48/128 cut-off events. For 43/59 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 404 event pairs, 1 based on Foata normal form. 8/123 useless extension candidates. Maximal degree in co-relation 158. Up to 55 conditions per place. [2022-12-06 05:37:07,591 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 38 transitions, 162 flow [2022-12-06 05:37:07,591 INFO L188 LiptonReduction]: Number of co-enabled transitions 414 [2022-12-06 05:37:07,595 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:37:07,601 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 05:37:07,601 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 138 flow [2022-12-06 05:37:07,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:07,602 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:07,602 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:07,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:37:07,602 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:37:07,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:07,603 INFO L85 PathProgramCache]: Analyzing trace with hash -128001960, now seen corresponding path program 1 times [2022-12-06 05:37:07,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:07,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829389855] [2022-12-06 05:37:07,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:07,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:07,712 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:37:07,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:07,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829389855] [2022-12-06 05:37:07,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829389855] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:07,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:07,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:37:07,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410413741] [2022-12-06 05:37:07,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:07,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:37:07,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:07,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:37:07,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:37:07,715 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2022-12-06 05:37:07,715 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:07,715 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:07,715 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2022-12-06 05:37:07,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:07,848 INFO L130 PetriNetUnfolder]: 600/912 cut-off events. [2022-12-06 05:37:07,848 INFO L131 PetriNetUnfolder]: For 618/675 co-relation queries the response was YES. [2022-12-06 05:37:07,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2493 conditions, 912 events. 600/912 cut-off events. For 618/675 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3837 event pairs, 333 based on Foata normal form. 104/896 useless extension candidates. Maximal degree in co-relation 1449. Up to 500 conditions per place. [2022-12-06 05:37:07,852 INFO L137 encePairwiseOnDemand]: 25/29 looper letters, 30 selfloop transitions, 2 changer transitions 20/54 dead transitions. [2022-12-06 05:37:07,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 285 flow [2022-12-06 05:37:07,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:37:07,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:37:07,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-06 05:37:07,853 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49137931034482757 [2022-12-06 05:37:07,853 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 138 flow. Second operand 4 states and 57 transitions. [2022-12-06 05:37:07,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 285 flow [2022-12-06 05:37:07,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 280 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 05:37:07,855 INFO L231 Difference]: Finished difference. Result has 42 places, 23 transitions, 80 flow [2022-12-06 05:37:07,855 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=42, PETRI_TRANSITIONS=23} [2022-12-06 05:37:07,856 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2022-12-06 05:37:07,856 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:37:07,856 INFO L89 Accepts]: Start accepts. Operand has 42 places, 23 transitions, 80 flow [2022-12-06 05:37:07,857 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:37:07,857 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:07,857 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 23 transitions, 80 flow [2022-12-06 05:37:07,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 23 transitions, 80 flow [2022-12-06 05:37:07,861 INFO L130 PetriNetUnfolder]: 2/28 cut-off events. [2022-12-06 05:37:07,861 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:37:07,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 28 events. 2/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 36. Up to 5 conditions per place. [2022-12-06 05:37:07,862 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 23 transitions, 80 flow [2022-12-06 05:37:07,862 INFO L188 LiptonReduction]: Number of co-enabled transitions 156 [2022-12-06 05:37:07,940 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:37:07,941 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-06 05:37:07,941 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 76 flow [2022-12-06 05:37:07,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:07,941 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:37:07,941 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:37:07,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 05:37:07,942 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:37:07,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:37:07,942 INFO L85 PathProgramCache]: Analyzing trace with hash 2006018516, now seen corresponding path program 1 times [2022-12-06 05:37:07,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:37:07,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408935989] [2022-12-06 05:37:07,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:37:07,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:37:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:37:08,086 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:37:08,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:37:08,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408935989] [2022-12-06 05:37:08,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408935989] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:37:08,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:37:08,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:37:08,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032073502] [2022-12-06 05:37:08,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:37:08,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:37:08,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:37:08,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:37:08,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:37:08,088 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 05:37:08,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 21 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:08,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:37:08,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 05:37:08,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:37:08,123 INFO L130 PetriNetUnfolder]: 61/119 cut-off events. [2022-12-06 05:37:08,124 INFO L131 PetriNetUnfolder]: For 235/235 co-relation queries the response was YES. [2022-12-06 05:37:08,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 119 events. 61/119 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 319 event pairs, 11 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 365. Up to 87 conditions per place. [2022-12-06 05:37:08,124 INFO L137 encePairwiseOnDemand]: 17/20 looper letters, 0 selfloop transitions, 0 changer transitions 23/23 dead transitions. [2022-12-06 05:37:08,124 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 23 transitions, 132 flow [2022-12-06 05:37:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:37:08,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:37:08,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2022-12-06 05:37:08,125 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3 [2022-12-06 05:37:08,125 INFO L175 Difference]: Start difference. First operand has 35 places, 21 transitions, 76 flow. Second operand 4 states and 24 transitions. [2022-12-06 05:37:08,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 23 transitions, 132 flow [2022-12-06 05:37:08,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 23 transitions, 105 flow, removed 6 selfloop flow, removed 10 redundant places. [2022-12-06 05:37:08,126 INFO L231 Difference]: Finished difference. Result has 26 places, 0 transitions, 0 flow [2022-12-06 05:37:08,126 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=41, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=26, PETRI_TRANSITIONS=0} [2022-12-06 05:37:08,127 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, -6 predicate places. [2022-12-06 05:37:08,127 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:37:08,127 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 0 transitions, 0 flow [2022-12-06 05:37:08,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 05:37:08,128 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 05:37:08,128 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:37:08,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-06 05:37:08,128 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 05:37:08,128 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 05:37:08,128 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:37:08,129 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-06 05:37:08,129 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 05:37:08,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:37:08,131 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 05:37:08,131 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 05:37:08,132 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 05:37:08,132 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 05:37:08,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:37:08,132 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-12-06 05:37:08,134 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 05:37:08,134 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 05:37:08,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:37:08 BasicIcfg [2022-12-06 05:37:08,136 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 05:37:08,137 INFO L158 Benchmark]: Toolchain (without parser) took 13916.95ms. Allocated memory was 183.5MB in the beginning and 273.7MB in the end (delta: 90.2MB). Free memory was 160.5MB in the beginning and 117.1MB in the end (delta: 43.5MB). Peak memory consumption was 134.0MB. Max. memory is 8.0GB. [2022-12-06 05:37:08,137 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory was 161.7MB in the beginning and 161.6MB in the end (delta: 78.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:37:08,137 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.29ms. Allocated memory is still 183.5MB. Free memory was 160.5MB in the beginning and 148.9MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:37:08,137 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.56ms. Allocated memory is still 183.5MB. Free memory was 148.9MB in the beginning and 146.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:37:08,138 INFO L158 Benchmark]: Boogie Preprocessor took 45.02ms. Allocated memory is still 183.5MB. Free memory was 146.9MB in the beginning and 145.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:37:08,138 INFO L158 Benchmark]: RCFGBuilder took 543.89ms. Allocated memory is still 183.5MB. Free memory was 145.5MB in the beginning and 127.7MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-06 05:37:08,138 INFO L158 Benchmark]: TraceAbstraction took 13040.07ms. Allocated memory was 183.5MB in the beginning and 273.7MB in the end (delta: 90.2MB). Free memory was 127.0MB in the beginning and 117.1MB in the end (delta: 9.9MB). Peak memory consumption was 100.4MB. Max. memory is 8.0GB. [2022-12-06 05:37:08,139 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 183.5MB. Free memory was 161.7MB in the beginning and 161.6MB in the end (delta: 78.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 228.29ms. Allocated memory is still 183.5MB. Free memory was 160.5MB in the beginning and 148.9MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.56ms. Allocated memory is still 183.5MB. Free memory was 148.9MB in the beginning and 146.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.02ms. Allocated memory is still 183.5MB. Free memory was 146.9MB in the beginning and 145.5MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 543.89ms. Allocated memory is still 183.5MB. Free memory was 145.5MB in the beginning and 127.7MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 13040.07ms. Allocated memory was 183.5MB in the beginning and 273.7MB in the end (delta: 90.2MB). Free memory was 127.0MB in the beginning and 117.1MB in the end (delta: 9.9MB). Peak memory consumption was 100.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1s, 154 PlacesBefore, 32 PlacesAfterwards, 159 TransitionsBefore, 28 TransitionsAfterwards, 3534 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 70 TrivialYvCompositions, 52 ConcurrentYvCompositions, 9 ChoiceCompositions, 131 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2160, independent: 2142, independent conditional: 2142, independent unconditional: 0, dependent: 18, dependent conditional: 18, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2160, independent: 2142, independent conditional: 0, independent unconditional: 2142, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2160, independent: 2142, independent conditional: 0, independent unconditional: 2142, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2160, independent: 2142, independent conditional: 0, independent unconditional: 2142, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2001, independent: 1989, independent conditional: 0, independent unconditional: 1989, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2001, independent: 1989, independent conditional: 0, independent unconditional: 1989, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2160, independent: 153, independent conditional: 0, independent unconditional: 153, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 2001, unknown conditional: 0, unknown unconditional: 2001] , Statistics on independence cache: Total cache size (in pairs): 3540, Positive cache size: 3528, Positive conditional cache size: 0, Positive unconditional cache size: 3528, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, 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, 29 PlacesBefore, 28 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, independent: 20, independent conditional: 20, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 28, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 28, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 28, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 10, Positive conditional cache size: 0, Positive unconditional cache size: 10, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 7, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 10, Positive conditional cache size: 0, Positive unconditional cache size: 10, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 37 PlacesBefore, 37 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 354 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 12, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 12, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 10, Positive conditional cache size: 0, Positive unconditional cache size: 10, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 38 TransitionsBefore, 35 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 65, independent: 61, independent conditional: 61, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 65, independent: 61, independent conditional: 49, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 65, independent: 61, independent conditional: 11, independent unconditional: 50, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 65, independent: 61, independent conditional: 11, independent unconditional: 50, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 2, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 65, independent: 46, independent conditional: 9, independent unconditional: 37, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 15, unknown conditional: 2, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 29, Positive cache size: 25, Positive conditional cache size: 2, Positive unconditional cache size: 23, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 37 PlacesBefore, 35 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, independent: 37, independent conditional: 37, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 41, independent: 37, independent conditional: 32, independent unconditional: 5, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 41, independent: 37, independent conditional: 13, independent unconditional: 24, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 41, independent: 37, independent conditional: 13, independent unconditional: 24, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 12, independent unconditional: 12, 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: 24, independent: 24, independent conditional: 0, independent unconditional: 24, 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: 41, independent: 13, independent conditional: 1, independent unconditional: 12, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 24, unknown conditional: 12, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 51, Positive conditional cache size: 14, Positive unconditional cache size: 37, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 21, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 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): 55, Positive cache size: 51, Positive conditional cache size: 14, Positive unconditional cache size: 37, Negative cache size: 4, Negative conditional cache size: 0, Negative unconditional cache size: 4, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 92]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 212 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.8s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 137 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 137 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 447 IncrementalHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 5 mSDtfsCounter, 447 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 122 NumberOfCodeBlocks, 122 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 500 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 4/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 05:37:08,171 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...