/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 23:42:41,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 23:42:41,421 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 23:42:41,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 23:42:41,461 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 23:42:41,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 23:42:41,463 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 23:42:41,464 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 23:42:41,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 23:42:41,467 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 23:42:41,468 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 23:42:41,469 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 23:42:41,469 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 23:42:41,470 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 23:42:41,471 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 23:42:41,472 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 23:42:41,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 23:42:41,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 23:42:41,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 23:42:41,477 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 23:42:41,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 23:42:41,480 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 23:42:41,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 23:42:41,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 23:42:41,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 23:42:41,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 23:42:41,485 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 23:42:41,486 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 23:42:41,486 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 23:42:41,487 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 23:42:41,487 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 23:42:41,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 23:42:41,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 23:42:41,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 23:42:41,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 23:42:41,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 23:42:41,495 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 23:42:41,496 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 23:42:41,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 23:42:41,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 23:42:41,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 23:42:41,501 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-RepeatedSemanticLbe.epf [2022-12-05 23:42:41,522 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 23:42:41,522 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 23:42:41,523 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 23:42:41,523 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 23:42:41,524 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 23:42:41,524 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 23:42:41,524 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 23:42:41,524 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 23:42:41,524 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 23:42:41,525 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 23:42:41,525 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 23:42:41,525 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 23:42:41,525 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 23:42:41,525 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 23:42:41,525 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 23:42:41,526 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 23:42:41,526 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 23:42:41,526 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 23:42:41,526 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 23:42:41,526 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 23:42:41,526 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 23:42:41,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:42:41,527 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 23:42:41,527 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 23:42:41,527 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 23:42:41,527 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 23:42:41,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 23:42:41,528 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-05 23:42:41,528 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-05 23:42:41,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 23:42:41,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 23:42:41,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 23:42:41,854 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 23:42:41,855 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 23:42:41,860 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i [2022-12-05 23:42:43,051 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 23:42:43,320 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 23:42:43,321 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i [2022-12-05 23:42:43,339 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a69dd6107/ce9f88bf4aec4278b23fe090c9e223db/FLAG8b200cfbb [2022-12-05 23:42:43,351 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a69dd6107/ce9f88bf4aec4278b23fe090c9e223db [2022-12-05 23:42:43,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 23:42:43,354 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 23:42:43,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 23:42:43,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 23:42:43,357 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 23:42:43,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:42:43" (1/1) ... [2022-12-05 23:42:43,359 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@293a2b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43, skipping insertion in model container [2022-12-05 23:42:43,359 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 11:42:43" (1/1) ... [2022-12-05 23:42:43,365 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 23:42:43,396 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 23:42:43,531 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i[1103,1116] [2022-12-05 23:42:43,676 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:42:43,690 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 23:42:43,702 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i[1103,1116] [2022-12-05 23:42:43,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 23:42:43,778 INFO L208 MainTranslator]: Completed translation [2022-12-05 23:42:43,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43 WrapperNode [2022-12-05 23:42:43,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 23:42:43,780 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 23:42:43,780 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 23:42:43,781 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 23:42:43,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43" (1/1) ... [2022-12-05 23:42:43,819 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43" (1/1) ... [2022-12-05 23:42:43,847 INFO L138 Inliner]: procedures = 162, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 77 [2022-12-05 23:42:43,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 23:42:43,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 23:42:43,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 23:42:43,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 23:42:43,856 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43" (1/1) ... [2022-12-05 23:42:43,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43" (1/1) ... [2022-12-05 23:42:43,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43" (1/1) ... [2022-12-05 23:42:43,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43" (1/1) ... [2022-12-05 23:42:43,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43" (1/1) ... [2022-12-05 23:42:43,879 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43" (1/1) ... [2022-12-05 23:42:43,880 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43" (1/1) ... [2022-12-05 23:42:43,881 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43" (1/1) ... [2022-12-05 23:42:43,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 23:42:43,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 23:42:43,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 23:42:43,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 23:42:43,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43" (1/1) ... [2022-12-05 23:42:43,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 23:42:43,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 23:42:43,919 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-05 23:42:43,921 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-05 23:42:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 23:42:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2022-12-05 23:42:43,950 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2022-12-05 23:42:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 23:42:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-05 23:42:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 23:42:43,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 23:42:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 23:42:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 23:42:43,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 23:42:43,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 23:42:43,952 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 23:42:44,094 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 23:42:44,096 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 23:42:44,340 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 23:42:44,346 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 23:42:44,346 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-05 23:42:44,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:42:44 BoogieIcfgContainer [2022-12-05 23:42:44,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 23:42:44,349 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 23:42:44,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 23:42:44,354 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 23:42:44,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 11:42:43" (1/3) ... [2022-12-05 23:42:44,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ea459f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:42:44, skipping insertion in model container [2022-12-05 23:42:44,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 11:42:43" (2/3) ... [2022-12-05 23:42:44,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20ea459f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 11:42:44, skipping insertion in model container [2022-12-05 23:42:44,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 11:42:44" (3/3) ... [2022-12-05 23:42:44,358 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_29-multiple-protecting2-vesal_true.i [2022-12-05 23:42:44,374 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 23:42:44,375 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-05 23:42:44,375 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 23:42:44,457 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-12-05 23:42:44,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 101 transitions, 210 flow [2022-12-05 23:42:44,561 INFO L130 PetriNetUnfolder]: 3/100 cut-off events. [2022-12-05 23:42:44,561 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-05 23:42:44,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 100 events. 3/100 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2022-12-05 23:42:44,566 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 101 transitions, 210 flow [2022-12-05 23:42:44,571 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 86 transitions, 175 flow [2022-12-05 23:42:44,573 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:44,595 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 86 transitions, 175 flow [2022-12-05 23:42:44,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 86 transitions, 175 flow [2022-12-05 23:42:44,635 INFO L130 PetriNetUnfolder]: 2/86 cut-off events. [2022-12-05 23:42:44,635 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:44,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 86 events. 2/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2022-12-05 23:42:44,639 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 86 transitions, 175 flow [2022-12-05 23:42:44,639 INFO L188 LiptonReduction]: Number of co-enabled transitions 1152 [2022-12-05 23:42:48,251 INFO L203 LiptonReduction]: Total number of compositions: 68 [2022-12-05 23:42:48,264 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 23:42:48,269 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;@703f84ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 23:42:48,269 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-05 23:42:48,272 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-05 23:42:48,272 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:48,272 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:48,273 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-05 23:42:48,273 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-12-05 23:42:48,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:48,277 INFO L85 PathProgramCache]: Analyzing trace with hash 10395528, now seen corresponding path program 1 times [2022-12-05 23:42:48,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:48,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508516847] [2022-12-05 23:42:48,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:48,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:48,416 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-05 23:42:48,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:48,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508516847] [2022-12-05 23:42:48,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508516847] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:48,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:48,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:42:48,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54011485] [2022-12-05 23:42:48,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:48,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-05 23:42:48,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:48,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-05 23:42:48,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-05 23:42:48,454 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 22 [2022-12-05 23:42:48,455 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 22 transitions, 47 flow. Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:48,455 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:48,456 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 22 [2022-12-05 23:42:48,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:48,533 INFO L130 PetriNetUnfolder]: 48/130 cut-off events. [2022-12-05 23:42:48,533 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:48,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 130 events. 48/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 478 event pairs, 48 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 238. Up to 113 conditions per place. [2022-12-05 23:42:48,536 INFO L137 encePairwiseOnDemand]: 21/22 looper letters, 16 selfloop transitions, 0 changer transitions 0/21 dead transitions. [2022-12-05 23:42:48,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 77 flow [2022-12-05 23:42:48,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-05 23:42:48,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-05 23:42:48,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 27 transitions. [2022-12-05 23:42:48,546 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6136363636363636 [2022-12-05 23:42:48,547 INFO L175 Difference]: Start difference. First operand has 25 places, 22 transitions, 47 flow. Second operand 2 states and 27 transitions. [2022-12-05 23:42:48,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 77 flow [2022-12-05 23:42:48,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 76 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 23:42:48,552 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 44 flow [2022-12-05 23:42:48,554 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2022-12-05 23:42:48,558 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2022-12-05 23:42:48,558 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:48,559 INFO L89 Accepts]: Start accepts. Operand has 25 places, 21 transitions, 44 flow [2022-12-05 23:42:48,561 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:48,561 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:48,561 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 21 transitions, 44 flow [2022-12-05 23:42:48,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 21 transitions, 44 flow [2022-12-05 23:42:48,575 INFO L130 PetriNetUnfolder]: 0/21 cut-off events. [2022-12-05 23:42:48,575 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:48,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 21 events. 0/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2022-12-05 23:42:48,576 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 21 transitions, 44 flow [2022-12-05 23:42:48,576 INFO L188 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-05 23:42:48,661 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:42:48,664 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-05 23:42:48,666 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 21 transitions, 44 flow [2022-12-05 23:42:48,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:48,667 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:48,667 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-05 23:42:48,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 23:42:48,667 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-12-05 23:42:48,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:48,669 INFO L85 PathProgramCache]: Analyzing trace with hash 322203426, now seen corresponding path program 1 times [2022-12-05 23:42:48,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:48,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110649753] [2022-12-05 23:42:48,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:48,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:48,813 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-05 23:42:48,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:48,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110649753] [2022-12-05 23:42:48,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110649753] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:48,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:48,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:42:48,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960495266] [2022-12-05 23:42:48,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:48,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:42:48,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:48,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:42:48,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:42:48,816 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2022-12-05 23:42:48,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 21 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:48,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:48,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2022-12-05 23:42:48,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:48,871 INFO L130 PetriNetUnfolder]: 52/141 cut-off events. [2022-12-05 23:42:48,871 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:48,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 141 events. 52/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 539 event pairs, 18 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 264. Up to 81 conditions per place. [2022-12-05 23:42:48,874 INFO L137 encePairwiseOnDemand]: 16/21 looper letters, 24 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2022-12-05 23:42:48,875 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 32 transitions, 122 flow [2022-12-05 23:42:48,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:42:48,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:42:48,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2022-12-05 23:42:48,877 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6507936507936508 [2022-12-05 23:42:48,877 INFO L175 Difference]: Start difference. First operand has 24 places, 21 transitions, 44 flow. Second operand 3 states and 41 transitions. [2022-12-05 23:42:48,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 32 transitions, 122 flow [2022-12-05 23:42:48,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 32 transitions, 122 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 23:42:48,878 INFO L231 Difference]: Finished difference. Result has 28 places, 23 transitions, 70 flow [2022-12-05 23:42:48,879 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=28, PETRI_TRANSITIONS=23} [2022-12-05 23:42:48,879 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 3 predicate places. [2022-12-05 23:42:48,880 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:48,880 INFO L89 Accepts]: Start accepts. Operand has 28 places, 23 transitions, 70 flow [2022-12-05 23:42:48,880 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:48,880 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:48,880 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 23 transitions, 70 flow [2022-12-05 23:42:48,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 23 transitions, 70 flow [2022-12-05 23:42:48,885 INFO L130 PetriNetUnfolder]: 2/32 cut-off events. [2022-12-05 23:42:48,885 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-05 23:42:48,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 32 events. 2/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 80 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 46. Up to 9 conditions per place. [2022-12-05 23:42:48,886 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 23 transitions, 70 flow [2022-12-05 23:42:48,886 INFO L188 LiptonReduction]: Number of co-enabled transitions 166 [2022-12-05 23:42:48,911 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:42:48,912 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-05 23:42:48,912 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 23 transitions, 70 flow [2022-12-05 23:42:48,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:48,913 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:48,913 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-05 23:42:48,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 23:42:48,913 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-12-05 23:42:48,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:48,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1398370193, now seen corresponding path program 1 times [2022-12-05 23:42:48,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:48,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395476276] [2022-12-05 23:42:48,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:48,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:48,978 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-05 23:42:48,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:48,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395476276] [2022-12-05 23:42:48,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395476276] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:48,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:48,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:42:48,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153475256] [2022-12-05 23:42:48,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:48,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:42:48,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:48,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:42:48,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:42:48,980 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2022-12-05 23:42:48,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 23 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:48,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:48,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2022-12-05 23:42:48,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:49,021 INFO L130 PetriNetUnfolder]: 49/131 cut-off events. [2022-12-05 23:42:49,022 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2022-12-05 23:42:49,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 296 conditions, 131 events. 49/131 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 483 event pairs, 15 based on Foata normal form. 3/132 useless extension candidates. Maximal degree in co-relation 284. Up to 76 conditions per place. [2022-12-05 23:42:49,023 INFO L137 encePairwiseOnDemand]: 17/21 looper letters, 25 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2022-12-05 23:42:49,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 32 transitions, 144 flow [2022-12-05 23:42:49,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:42:49,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:42:49,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2022-12-05 23:42:49,024 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6349206349206349 [2022-12-05 23:42:49,025 INFO L175 Difference]: Start difference. First operand has 28 places, 23 transitions, 70 flow. Second operand 3 states and 40 transitions. [2022-12-05 23:42:49,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 32 transitions, 144 flow [2022-12-05 23:42:49,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 32 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:42:49,026 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 64 flow [2022-12-05 23:42:49,026 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2022-12-05 23:42:49,027 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 3 predicate places. [2022-12-05 23:42:49,027 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:49,027 INFO L89 Accepts]: Start accepts. Operand has 28 places, 22 transitions, 64 flow [2022-12-05 23:42:49,028 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:49,028 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:49,028 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 22 transitions, 64 flow [2022-12-05 23:42:49,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 22 transitions, 64 flow [2022-12-05 23:42:49,031 INFO L130 PetriNetUnfolder]: 1/27 cut-off events. [2022-12-05 23:42:49,031 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-05 23:42:49,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 27 events. 1/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 event pairs, 1 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 36. Up to 7 conditions per place. [2022-12-05 23:42:49,032 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 28 places, 22 transitions, 64 flow [2022-12-05 23:42:49,032 INFO L188 LiptonReduction]: Number of co-enabled transitions 160 [2022-12-05 23:42:49,069 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:42:49,070 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 43 [2022-12-05 23:42:49,070 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 64 flow [2022-12-05 23:42:49,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:49,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:49,071 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:49,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 23:42:49,072 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-12-05 23:42:49,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:49,072 INFO L85 PathProgramCache]: Analyzing trace with hash -490062058, now seen corresponding path program 1 times [2022-12-05 23:42:49,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:49,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714865571] [2022-12-05 23:42:49,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:49,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:49,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:49,204 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-05 23:42:49,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:49,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714865571] [2022-12-05 23:42:49,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714865571] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:49,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:49,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:42:49,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629351736] [2022-12-05 23:42:49,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:49,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:42:49,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:49,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:42:49,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:42:49,207 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 21 [2022-12-05 23:42:49,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 64 flow. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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-05 23:42:49,208 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:49,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 21 [2022-12-05 23:42:49,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:49,301 INFO L130 PetriNetUnfolder]: 44/121 cut-off events. [2022-12-05 23:42:49,302 INFO L131 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-12-05 23:42:49,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 121 events. 44/121 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 430 event pairs, 15 based on Foata normal form. 5/124 useless extension candidates. Maximal degree in co-relation 254. Up to 44 conditions per place. [2022-12-05 23:42:49,303 INFO L137 encePairwiseOnDemand]: 13/21 looper letters, 31 selfloop transitions, 10 changer transitions 0/45 dead transitions. [2022-12-05 23:42:49,303 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 45 transitions, 196 flow [2022-12-05 23:42:49,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:42:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:42:49,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 67 transitions. [2022-12-05 23:42:49,306 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5317460317460317 [2022-12-05 23:42:49,306 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 64 flow. Second operand 6 states and 67 transitions. [2022-12-05 23:42:49,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 45 transitions, 196 flow [2022-12-05 23:42:49,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 45 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:42:49,308 INFO L231 Difference]: Finished difference. Result has 32 places, 26 transitions, 105 flow [2022-12-05 23:42:49,308 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=21, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=105, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2022-12-05 23:42:49,309 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 7 predicate places. [2022-12-05 23:42:49,309 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:49,309 INFO L89 Accepts]: Start accepts. Operand has 32 places, 26 transitions, 105 flow [2022-12-05 23:42:49,310 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:49,310 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:49,310 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 26 transitions, 105 flow [2022-12-05 23:42:49,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 26 transitions, 105 flow [2022-12-05 23:42:49,314 INFO L130 PetriNetUnfolder]: 2/34 cut-off events. [2022-12-05 23:42:49,314 INFO L131 PetriNetUnfolder]: For 11/12 co-relation queries the response was YES. [2022-12-05 23:42:49,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72 conditions, 34 events. 2/34 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 68 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 61. Up to 7 conditions per place. [2022-12-05 23:42:49,315 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 26 transitions, 105 flow [2022-12-05 23:42:49,315 INFO L188 LiptonReduction]: Number of co-enabled transitions 146 [2022-12-05 23:42:49,366 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:42:49,367 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 58 [2022-12-05 23:42:49,367 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 103 flow [2022-12-05 23:42:49,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 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-05 23:42:49,367 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:49,367 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:49,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-05 23:42:49,368 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-12-05 23:42:49,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:49,368 INFO L85 PathProgramCache]: Analyzing trace with hash -341375169, now seen corresponding path program 1 times [2022-12-05 23:42:49,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:49,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913844840] [2022-12-05 23:42:49,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:49,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:49,424 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-05 23:42:49,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:49,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913844840] [2022-12-05 23:42:49,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913844840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:49,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:49,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:42:49,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221665923] [2022-12-05 23:42:49,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:49,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:42:49,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:49,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:42:49,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:42:49,426 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2022-12-05 23:42:49,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 103 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:49,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:49,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2022-12-05 23:42:49,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:49,486 INFO L130 PetriNetUnfolder]: 41/109 cut-off events. [2022-12-05 23:42:49,486 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2022-12-05 23:42:49,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 109 events. 41/109 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 337 event pairs, 17 based on Foata normal form. 5/113 useless extension candidates. Maximal degree in co-relation 275. Up to 48 conditions per place. [2022-12-05 23:42:49,490 INFO L137 encePairwiseOnDemand]: 13/19 looper letters, 28 selfloop transitions, 7 changer transitions 0/38 dead transitions. [2022-12-05 23:42:49,491 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 189 flow [2022-12-05 23:42:49,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 23:42:49,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 23:42:49,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-12-05 23:42:49,494 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-05 23:42:49,494 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 103 flow. Second operand 6 states and 54 transitions. [2022-12-05 23:42:49,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 189 flow [2022-12-05 23:42:49,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 176 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-05 23:42:49,498 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 84 flow [2022-12-05 23:42:49,499 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=84, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2022-12-05 23:42:49,501 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 6 predicate places. [2022-12-05 23:42:49,501 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:49,501 INFO L89 Accepts]: Start accepts. Operand has 31 places, 22 transitions, 84 flow [2022-12-05 23:42:49,502 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:49,502 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:49,502 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 22 transitions, 84 flow [2022-12-05 23:42:49,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 84 flow [2022-12-05 23:42:49,506 INFO L130 PetriNetUnfolder]: 2/26 cut-off events. [2022-12-05 23:42:49,506 INFO L131 PetriNetUnfolder]: For 12/13 co-relation queries the response was YES. [2022-12-05 23:42:49,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 26 events. 2/26 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 45. Up to 5 conditions per place. [2022-12-05 23:42:49,506 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 22 transitions, 84 flow [2022-12-05 23:42:49,506 INFO L188 LiptonReduction]: Number of co-enabled transitions 120 [2022-12-05 23:42:49,617 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-05 23:42:49,618 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 117 [2022-12-05 23:42:49,618 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 86 flow [2022-12-05 23:42:49,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:49,618 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:49,618 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:49,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 23:42:49,619 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-12-05 23:42:49,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:49,619 INFO L85 PathProgramCache]: Analyzing trace with hash -340504693, now seen corresponding path program 1 times [2022-12-05 23:42:49,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:49,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081525708] [2022-12-05 23:42:49,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:49,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:49,663 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-05 23:42:49,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:49,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081525708] [2022-12-05 23:42:49,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081525708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:49,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:49,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 23:42:49,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605501684] [2022-12-05 23:42:49,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:49,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:42:49,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:49,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:42:49,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:42:49,665 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 19 [2022-12-05 23:42:49,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:49,665 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:49,665 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 19 [2022-12-05 23:42:49,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:49,692 INFO L130 PetriNetUnfolder]: 31/89 cut-off events. [2022-12-05 23:42:49,692 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-05 23:42:49,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241 conditions, 89 events. 31/89 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 260 event pairs, 11 based on Foata normal form. 3/87 useless extension candidates. Maximal degree in co-relation 228. Up to 56 conditions per place. [2022-12-05 23:42:49,693 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 16 selfloop transitions, 2 changer transitions 2/22 dead transitions. [2022-12-05 23:42:49,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 22 transitions, 115 flow [2022-12-05 23:42:49,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:42:49,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:42:49,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2022-12-05 23:42:49,694 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49122807017543857 [2022-12-05 23:42:49,694 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 86 flow. Second operand 3 states and 28 transitions. [2022-12-05 23:42:49,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 22 transitions, 115 flow [2022-12-05 23:42:49,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 22 transitions, 101 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-05 23:42:49,695 INFO L231 Difference]: Finished difference. Result has 28 places, 16 transitions, 54 flow [2022-12-05 23:42:49,695 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=28, PETRI_TRANSITIONS=16} [2022-12-05 23:42:49,696 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, 3 predicate places. [2022-12-05 23:42:49,696 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:49,696 INFO L89 Accepts]: Start accepts. Operand has 28 places, 16 transitions, 54 flow [2022-12-05 23:42:49,697 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:49,697 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:49,697 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 16 transitions, 54 flow [2022-12-05 23:42:49,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 16 transitions, 54 flow [2022-12-05 23:42:49,700 INFO L130 PetriNetUnfolder]: 0/19 cut-off events. [2022-12-05 23:42:49,700 INFO L131 PetriNetUnfolder]: For 3/4 co-relation queries the response was YES. [2022-12-05 23:42:49,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 19 events. 0/19 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 17 event pairs, 0 based on Foata normal form. 1/20 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-12-05 23:42:49,700 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 16 transitions, 54 flow [2022-12-05 23:42:49,701 INFO L188 LiptonReduction]: Number of co-enabled transitions 78 [2022-12-05 23:42:49,715 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:42:49,716 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 20 [2022-12-05 23:42:49,717 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 54 flow [2022-12-05 23:42:49,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:49,717 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:49,717 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:49,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 23:42:49,717 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-12-05 23:42:49,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:49,718 INFO L85 PathProgramCache]: Analyzing trace with hash 978893037, now seen corresponding path program 1 times [2022-12-05 23:42:49,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:49,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549795265] [2022-12-05 23:42:49,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:49,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:49,785 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-05 23:42:49,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:49,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549795265] [2022-12-05 23:42:49,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549795265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:49,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:49,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:42:49,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321877104] [2022-12-05 23:42:49,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:49,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 23:42:49,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:49,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 23:42:49,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 23:42:49,787 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-05 23:42:49,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 16 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:49,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:49,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-05 23:42:49,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:49,827 INFO L130 PetriNetUnfolder]: 22/71 cut-off events. [2022-12-05 23:42:49,828 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-12-05 23:42:49,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 71 events. 22/71 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 167 event pairs, 12 based on Foata normal form. 11/82 useless extension candidates. Maximal degree in co-relation 166. Up to 39 conditions per place. [2022-12-05 23:42:49,828 INFO L137 encePairwiseOnDemand]: 7/15 looper letters, 14 selfloop transitions, 8 changer transitions 0/22 dead transitions. [2022-12-05 23:42:49,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 22 transitions, 114 flow [2022-12-05 23:42:49,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 23:42:49,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 23:42:49,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-12-05 23:42:49,829 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-05 23:42:49,829 INFO L175 Difference]: Start difference. First operand has 24 places, 16 transitions, 54 flow. Second operand 3 states and 25 transitions. [2022-12-05 23:42:49,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 22 transitions, 114 flow [2022-12-05 23:42:49,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 22 transitions, 108 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-12-05 23:42:49,831 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 80 flow [2022-12-05 23:42:49,831 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2022-12-05 23:42:49,831 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2022-12-05 23:42:49,831 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:49,832 INFO L89 Accepts]: Start accepts. Operand has 24 places, 18 transitions, 80 flow [2022-12-05 23:42:49,832 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:49,832 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:49,832 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 18 transitions, 80 flow [2022-12-05 23:42:49,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 18 transitions, 80 flow [2022-12-05 23:42:49,837 INFO L130 PetriNetUnfolder]: 4/35 cut-off events. [2022-12-05 23:42:49,837 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-12-05 23:42:49,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 35 events. 4/35 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 3 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 79. Up to 14 conditions per place. [2022-12-05 23:42:49,837 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 18 transitions, 80 flow [2022-12-05 23:42:49,838 INFO L188 LiptonReduction]: Number of co-enabled transitions 36 [2022-12-05 23:42:50,136 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [320] L704-1-->ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#pthreadsMutex_1120| |v_~#__global_lock~0.base_374|))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_237| 0) (= |v_#pthreadsMutex_1119| (store |v_#pthreadsMutex_1120| |v_~#__global_lock~0.base_374| (store .cse0 |v_~#__global_lock~0.offset_374| 1))) (= (ite (= v_~g2~0_461 0) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_319|) (= (select .cse0 |v_~#__global_lock~0.offset_374|) 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_319| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_237|))) InVars {~g2~0=v_~g2~0_461, #pthreadsMutex=|v_#pthreadsMutex_1120|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_374|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_374|} OutVars{~g2~0=v_~g2~0_461, #pthreadsMutex=|v_#pthreadsMutex_1119|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_120|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_143|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_319|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_374|, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_237|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_374|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start___VERIFIER_assert_~cond#1] and [302] L693-->t2_funEXIT: Formula: (and (= |v_t2_funThread1of1ForFork0_#res.base_7| 0) (= |v_t2_funThread1of1ForFork0_#res.offset_7| 0) (= (store |v_#pthreadsMutex_376| |v_~#mutex2~0.base_83| (store (select |v_#pthreadsMutex_376| |v_~#mutex2~0.base_83|) |v_~#mutex2~0.offset_83| 0)) |v_#pthreadsMutex_375|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_376|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_83|, ~#mutex2~0.base=|v_~#mutex2~0.base_83|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_375|, t2_funThread1of1ForFork0_#res.offset=|v_t2_funThread1of1ForFork0_#res.offset_7|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_83|, ~#mutex2~0.base=|v_~#mutex2~0.base_83|, t2_funThread1of1ForFork0_#res.base=|v_t2_funThread1of1ForFork0_#res.base_7|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#res.offset, t2_funThread1of1ForFork0_#res.base] [2022-12-05 23:42:50,183 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [316] L700-->L701-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_867| |v_~#__global_lock~0.base_273|))) (and (= |v_#pthreadsMutex_866| (store |v_#pthreadsMutex_867| |v_~#__global_lock~0.base_273| (store .cse0 |v_~#__global_lock~0.offset_273| 1))) (= (select .cse0 |v_~#__global_lock~0.offset_273|) 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_199| (ite (<= 0 v_~g2~0_288) 1 0)))) InVars {~g2~0=v_~g2~0_288, #pthreadsMutex=|v_#pthreadsMutex_867|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_273|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_273|} OutVars{~g2~0=v_~g2~0_288, #pthreadsMutex=|v_#pthreadsMutex_866|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_199|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_110|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_273|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_273|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start_main_#t~nondet9#1] and [302] L693-->t2_funEXIT: Formula: (and (= |v_t2_funThread1of1ForFork0_#res.base_7| 0) (= |v_t2_funThread1of1ForFork0_#res.offset_7| 0) (= (store |v_#pthreadsMutex_376| |v_~#mutex2~0.base_83| (store (select |v_#pthreadsMutex_376| |v_~#mutex2~0.base_83|) |v_~#mutex2~0.offset_83| 0)) |v_#pthreadsMutex_375|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_376|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_83|, ~#mutex2~0.base=|v_~#mutex2~0.base_83|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_375|, t2_funThread1of1ForFork0_#res.offset=|v_t2_funThread1of1ForFork0_#res.offset_7|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_83|, ~#mutex2~0.base=|v_~#mutex2~0.base_83|, t2_funThread1of1ForFork0_#res.base=|v_t2_funThread1of1ForFork0_#res.base_7|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#res.offset, t2_funThread1of1ForFork0_#res.base] [2022-12-05 23:42:50,218 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [326] L704-1-->ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#pthreadsMutex_1179| |v_~#__global_lock~0.base_395|))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_243| 0) (= |v_#pthreadsMutex_1178| (store |v_#pthreadsMutex_1179| |v_~#__global_lock~0.base_395| (store .cse0 |v_~#__global_lock~0.offset_395| 1))) (= (select .cse0 |v_~#__global_lock~0.offset_395|) 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_327| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_243|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_327| (ite (= v_~g2~0_501 0) 1 0)))) InVars {~g2~0=v_~g2~0_501, #pthreadsMutex=|v_#pthreadsMutex_1179|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_395|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_395|} OutVars{~g2~0=v_~g2~0_501, #pthreadsMutex=|v_#pthreadsMutex_1178|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_124|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_153|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_327|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_395|, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_243|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_395|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start___VERIFIER_assert_~cond#1] and [302] L693-->t2_funEXIT: Formula: (and (= |v_t2_funThread1of1ForFork0_#res.base_7| 0) (= |v_t2_funThread1of1ForFork0_#res.offset_7| 0) (= (store |v_#pthreadsMutex_376| |v_~#mutex2~0.base_83| (store (select |v_#pthreadsMutex_376| |v_~#mutex2~0.base_83|) |v_~#mutex2~0.offset_83| 0)) |v_#pthreadsMutex_375|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_376|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_83|, ~#mutex2~0.base=|v_~#mutex2~0.base_83|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_375|, t2_funThread1of1ForFork0_#res.offset=|v_t2_funThread1of1ForFork0_#res.offset_7|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_83|, ~#mutex2~0.base=|v_~#mutex2~0.base_83|, t2_funThread1of1ForFork0_#res.base=|v_t2_funThread1of1ForFork0_#res.base_7|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#res.offset, t2_funThread1of1ForFork0_#res.base] [2022-12-05 23:42:50,277 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [328] L700-->t2_funEXIT: Formula: (let ((.cse0 (select |v_#pthreadsMutex_1218| |v_~#__global_lock~0.base_409|))) (and (= |v_t2_funThread1of1ForFork0_#res.base_37| 0) (= (select .cse0 |v_~#__global_lock~0.offset_409|) 0) (= |v_t2_funThread1of1ForFork0_#res.offset_37| 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_331| (ite (<= 0 v_~g2~0_527) 1 0)) (= |v_#pthreadsMutex_1216| (let ((.cse1 (store |v_#pthreadsMutex_1218| |v_~#__global_lock~0.base_409| (store .cse0 |v_~#__global_lock~0.offset_409| 1)))) (store .cse1 |v_~#mutex2~0.base_215| (store (select .cse1 |v_~#mutex2~0.base_215|) |v_~#mutex2~0.offset_215| 0)))))) InVars {~g2~0=v_~g2~0_527, #pthreadsMutex=|v_#pthreadsMutex_1218|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_409|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_215|, ~#mutex2~0.base=|v_~#mutex2~0.base_215|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_409|} OutVars{~g2~0=v_~g2~0_527, #pthreadsMutex=|v_#pthreadsMutex_1216|, t2_funThread1of1ForFork0_#res.offset=|v_t2_funThread1of1ForFork0_#res.offset_37|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_331|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_146|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_409|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_215|, ~#mutex2~0.base=|v_~#mutex2~0.base_215|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_409|, t2_funThread1of1ForFork0_#res.base=|v_t2_funThread1of1ForFork0_#res.base_37|} AuxVars[] AssignedVars[#pthreadsMutex, t2_funThread1of1ForFork0_#res.offset, ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start_main_#t~nondet9#1, t2_funThread1of1ForFork0_#res.base] and [317] L701-1-->L704: Formula: (and (not (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_207| 0)) (= (store |v_#pthreadsMutex_927| |v_~#__global_lock~0.base_298| (store (select |v_#pthreadsMutex_927| |v_~#__global_lock~0.base_298|) |v_~#__global_lock~0.offset_298| 0)) |v_#pthreadsMutex_926|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_247| (ite (<= v_~g2~0_357 1) 1 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_247| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_207|) (not (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_248| 0))) InVars {~g2~0=v_~g2~0_357, #pthreadsMutex=|v_#pthreadsMutex_927|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_248|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_298|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_298|} OutVars{~g2~0=v_~g2~0_357, #pthreadsMutex=|v_#pthreadsMutex_926|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_247|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_298|, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_207|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_298|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start___VERIFIER_assert_~cond#1] [2022-12-05 23:42:50,348 INFO L203 LiptonReduction]: Total number of compositions: 9 [2022-12-05 23:42:50,349 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 518 [2022-12-05 23:42:50,350 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 13 transitions, 86 flow [2022-12-05 23:42:50,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:50,350 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:50,350 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:50,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 23:42:50,350 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-12-05 23:42:50,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:50,351 INFO L85 PathProgramCache]: Analyzing trace with hash 404813718, now seen corresponding path program 1 times [2022-12-05 23:42:50,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:50,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642673261] [2022-12-05 23:42:50,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:50,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:50,442 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-05 23:42:50,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:50,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642673261] [2022-12-05 23:42:50,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642673261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:50,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:50,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:42:50,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649504986] [2022-12-05 23:42:50,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:50,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:42:50,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:50,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:42:50,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:42:50,444 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-05 23:42:50,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 13 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:50,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:50,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-05 23:42:50,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:50,468 INFO L130 PetriNetUnfolder]: 7/23 cut-off events. [2022-12-05 23:42:50,468 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-05 23:42:50,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 23 events. 7/23 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 1 based on Foata normal form. 3/26 useless extension candidates. Maximal degree in co-relation 80. Up to 15 conditions per place. [2022-12-05 23:42:50,468 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 7 selfloop transitions, 5 changer transitions 0/12 dead transitions. [2022-12-05 23:42:50,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 12 transitions, 89 flow [2022-12-05 23:42:50,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:42:50,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:42:50,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2022-12-05 23:42:50,469 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2692307692307692 [2022-12-05 23:42:50,469 INFO L175 Difference]: Start difference. First operand has 18 places, 13 transitions, 86 flow. Second operand 4 states and 14 transitions. [2022-12-05 23:42:50,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 12 transitions, 89 flow [2022-12-05 23:42:50,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 12 transitions, 70 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-05 23:42:50,472 INFO L231 Difference]: Finished difference. Result has 18 places, 10 transitions, 50 flow [2022-12-05 23:42:50,472 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=10, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=5, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=50, PETRI_PLACES=18, PETRI_TRANSITIONS=10} [2022-12-05 23:42:50,473 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, -7 predicate places. [2022-12-05 23:42:50,473 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:50,473 INFO L89 Accepts]: Start accepts. Operand has 18 places, 10 transitions, 50 flow [2022-12-05 23:42:50,474 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:50,474 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:50,474 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 18 places, 10 transitions, 50 flow [2022-12-05 23:42:50,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 18 places, 10 transitions, 50 flow [2022-12-05 23:42:50,477 INFO L130 PetriNetUnfolder]: 4/17 cut-off events. [2022-12-05 23:42:50,477 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 23:42:50,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 17 events. 4/17 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 24 event pairs, 2 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 38. Up to 12 conditions per place. [2022-12-05 23:42:50,478 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 18 places, 10 transitions, 50 flow [2022-12-05 23:42:50,480 INFO L188 LiptonReduction]: Number of co-enabled transitions 6 [2022-12-05 23:42:50,926 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [325] L690-->L693: Formula: (let ((.cse0 (select |v_#pthreadsMutex_1161| |v_~#__global_lock~0.base_389|))) (and (= |v_#pthreadsMutex_1159| (store |v_#pthreadsMutex_1161| |v_~#__global_lock~0.base_389| (store .cse0 |v_~#__global_lock~0.offset_389| 0))) (= (select .cse0 |v_~#__global_lock~0.offset_389|) 0) (= v_~g2~0_487 (+ v_~g2~0_486 1)))) InVars {~g2~0=v_~g2~0_487, #pthreadsMutex=|v_#pthreadsMutex_1161|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_389|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_389|} OutVars{~g2~0=v_~g2~0_486, #pthreadsMutex=|v_#pthreadsMutex_1159|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_389|, t2_funThread1of1ForFork0_#t~nondet4=|v_t2_funThread1of1ForFork0_#t~nondet4_69|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_389|, t2_funThread1of1ForFork0_#t~post5=|v_t2_funThread1of1ForFork0_#t~post5_79|} AuxVars[] AssignedVars[~g2~0, #pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet4, t2_funThread1of1ForFork0_#t~post5] and [334] L698-3-->ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (select |v_#pthreadsMutex_1277| |v_~#mutex1~0.base_114|))) (let ((.cse7 (store |v_#pthreadsMutex_1277| |v_~#mutex1~0.base_114| (store .cse1 |v_~#mutex1~0.offset_114| 1)))) (let ((.cse2 (select .cse7 |v_~#__global_lock~0.base_429|))) (let ((.cse3 (let ((.cse4 (let ((.cse5 (let ((.cse6 (store .cse7 |v_~#__global_lock~0.base_429| (store .cse2 |v_~#__global_lock~0.offset_426| 1)))) (store .cse6 |v_~#mutex2~0.base_233| (store (select .cse6 |v_~#mutex2~0.base_233|) |v_~#mutex2~0.offset_232| 0))))) (store .cse5 |v_~#__global_lock~0.base_429| (store (select .cse5 |v_~#__global_lock~0.base_429|) |v_~#__global_lock~0.offset_426| 0))))) (store .cse4 |v_~#mutex2~0.base_233| (store (select .cse4 |v_~#mutex2~0.base_233|) |v_~#mutex2~0.offset_232| 1))))) (let ((.cse0 (select .cse3 |v_~#__global_lock~0.base_429|))) (and (= (select .cse0 |v_~#__global_lock~0.offset_426|) 0) (= (ite (= v_~g2~0_549 0) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_347|) (not (= (ite (<= 0 v_~g2~0_549) 1 0) 0)) (= (select .cse1 |v_~#mutex1~0.offset_114|) 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_347| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_259|) (not (= (ite (<= v_~g2~0_549 1) 1 0) 0)) (= |v_t2_funThread1of1ForFork0_#res.offset_48| 0) (= (select .cse2 |v_~#__global_lock~0.offset_426|) 0) (= (store .cse3 |v_~#__global_lock~0.base_429| (store .cse0 |v_~#__global_lock~0.offset_426| 1)) |v_#pthreadsMutex_1275|) (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_259| 0) (= |v_t2_funThread1of1ForFork0_#res.base_48| 0))))))) InVars {~g2~0=v_~g2~0_549, #pthreadsMutex=|v_#pthreadsMutex_1277|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_114|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_426|, ~#mutex1~0.base=|v_~#mutex1~0.base_114|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_232|, ~#mutex2~0.base=|v_~#mutex2~0.base_233|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_429|} OutVars{~g2~0=v_~g2~0_549, #pthreadsMutex=|v_#pthreadsMutex_1275|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_170|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_90|, t2_funThread1of1ForFork0_#res.offset=|v_t2_funThread1of1ForFork0_#res.offset_48|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_347|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_154|, ~#mutex1~0.offset=|v_~#mutex1~0.offset_114|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_426|, ~#mutex1~0.base=|v_~#mutex1~0.base_114|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_429|, t2_funThread1of1ForFork0_#res.base=|v_t2_funThread1of1ForFork0_#res.base_48|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_136|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_93|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_88|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_232|, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_259|, ~#mutex2~0.base=|v_~#mutex2~0.base_233|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre6#1, t2_funThread1of1ForFork0_#res.offset, ULTIMATE.start___VERIFIER_assert_#in~cond#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start___VERIFIER_assert_~cond#1, t2_funThread1of1ForFork0_#res.base] [2022-12-05 23:42:51,120 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-05 23:42:51,121 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 648 [2022-12-05 23:42:51,121 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 8 transitions, 48 flow [2022-12-05 23:42:51,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:51,121 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:51,121 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-05 23:42:51,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-05 23:42:51,122 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-12-05 23:42:51,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:51,122 INFO L85 PathProgramCache]: Analyzing trace with hash 10395906, now seen corresponding path program 1 times [2022-12-05 23:42:51,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:51,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144888130] [2022-12-05 23:42:51,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:51,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:51,731 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-05 23:42:51,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:51,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144888130] [2022-12-05 23:42:51,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144888130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:51,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:51,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:42:51,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846724349] [2022-12-05 23:42:51,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:51,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:42:51,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:51,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:42:51,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:42:51,733 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 8 [2022-12-05 23:42:51,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 16 places, 8 transitions, 48 flow. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:51,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:51,733 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 8 [2022-12-05 23:42:51,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:51,747 INFO L130 PetriNetUnfolder]: 3/13 cut-off events. [2022-12-05 23:42:51,747 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 23:42:51,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 13 events. 3/13 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 2 based on Foata normal form. 1/14 useless extension candidates. Maximal degree in co-relation 41. Up to 11 conditions per place. [2022-12-05 23:42:51,747 INFO L137 encePairwiseOnDemand]: 4/8 looper letters, 5 selfloop transitions, 3 changer transitions 0/8 dead transitions. [2022-12-05 23:42:51,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 8 transitions, 58 flow [2022-12-05 23:42:51,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:42:51,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:42:51,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2022-12-05 23:42:51,748 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28125 [2022-12-05 23:42:51,748 INFO L175 Difference]: Start difference. First operand has 16 places, 8 transitions, 48 flow. Second operand 4 states and 9 transitions. [2022-12-05 23:42:51,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 8 transitions, 58 flow [2022-12-05 23:42:51,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 8 transitions, 54 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 23:42:51,749 INFO L231 Difference]: Finished difference. Result has 17 places, 7 transitions, 40 flow [2022-12-05 23:42:51,749 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=8, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=40, PETRI_PLACES=17, PETRI_TRANSITIONS=7} [2022-12-05 23:42:51,750 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, -8 predicate places. [2022-12-05 23:42:51,750 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:51,750 INFO L89 Accepts]: Start accepts. Operand has 17 places, 7 transitions, 40 flow [2022-12-05 23:42:51,750 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:51,750 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:51,750 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 17 places, 7 transitions, 40 flow [2022-12-05 23:42:51,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 17 places, 7 transitions, 40 flow [2022-12-05 23:42:51,753 INFO L130 PetriNetUnfolder]: 3/13 cut-off events. [2022-12-05 23:42:51,753 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-05 23:42:51,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 13 events. 3/13 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 10 event pairs, 3 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 31. Up to 11 conditions per place. [2022-12-05 23:42:51,753 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 17 places, 7 transitions, 40 flow [2022-12-05 23:42:51,753 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:42:51,758 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [325] L690-->L693: Formula: (let ((.cse0 (select |v_#pthreadsMutex_1161| |v_~#__global_lock~0.base_389|))) (and (= |v_#pthreadsMutex_1159| (store |v_#pthreadsMutex_1161| |v_~#__global_lock~0.base_389| (store .cse0 |v_~#__global_lock~0.offset_389| 0))) (= (select .cse0 |v_~#__global_lock~0.offset_389|) 0) (= v_~g2~0_487 (+ v_~g2~0_486 1)))) InVars {~g2~0=v_~g2~0_487, #pthreadsMutex=|v_#pthreadsMutex_1161|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_389|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_389|} OutVars{~g2~0=v_~g2~0_486, #pthreadsMutex=|v_#pthreadsMutex_1159|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_389|, t2_funThread1of1ForFork0_#t~nondet4=|v_t2_funThread1of1ForFork0_#t~nondet4_69|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_389|, t2_funThread1of1ForFork0_#t~post5=|v_t2_funThread1of1ForFork0_#t~post5_79|} AuxVars[] AssignedVars[~g2~0, #pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet4, t2_funThread1of1ForFork0_#t~post5] and [324] $Ultimate##0-->L690: Formula: (let ((.cse1 (select |v_#pthreadsMutex_1155| |v_~#mutex2~0.base_199|))) (let ((.cse2 (store |v_#pthreadsMutex_1155| |v_~#mutex2~0.base_199| (store .cse1 |v_~#mutex2~0.offset_199| 1)))) (let ((.cse0 (select .cse2 |v_~#__global_lock~0.base_387|))) (and (= v_t2_funThread1of1ForFork0_~arg.base_50 |v_t2_funThread1of1ForFork0_#in~arg.base_50|) (= (select .cse0 |v_~#__global_lock~0.offset_387|) 0) (= v_t2_funThread1of1ForFork0_~arg.offset_50 |v_t2_funThread1of1ForFork0_#in~arg.offset_50|) (= (+ v_~g2~0_483 1) v_~g2~0_482) (= (select .cse1 |v_~#mutex2~0.offset_199|) 0) (= |v_#pthreadsMutex_1153| (store .cse2 |v_~#__global_lock~0.base_387| (store .cse0 |v_~#__global_lock~0.offset_387| 0))))))) InVars {~g2~0=v_~g2~0_483, #pthreadsMutex=|v_#pthreadsMutex_1155|, t2_funThread1of1ForFork0_#in~arg.offset=|v_t2_funThread1of1ForFork0_#in~arg.offset_50|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_387|, t2_funThread1of1ForFork0_#in~arg.base=|v_t2_funThread1of1ForFork0_#in~arg.base_50|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_199|, ~#mutex2~0.base=|v_~#mutex2~0.base_199|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_387|} OutVars{~g2~0=v_~g2~0_482, #pthreadsMutex=|v_#pthreadsMutex_1153|, t2_funThread1of1ForFork0_~arg.base=v_t2_funThread1of1ForFork0_~arg.base_50, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_387|, t2_funThread1of1ForFork0_#t~nondet2=|v_t2_funThread1of1ForFork0_#t~nondet2_119|, t2_funThread1of1ForFork0_#t~nondet1=|v_t2_funThread1of1ForFork0_#t~nondet1_76|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_387|, t2_funThread1of1ForFork0_#in~arg.offset=|v_t2_funThread1of1ForFork0_#in~arg.offset_50|, t2_funThread1of1ForFork0_#t~post3=|v_t2_funThread1of1ForFork0_#t~post3_227|, t2_funThread1of1ForFork0_#in~arg.base=|v_t2_funThread1of1ForFork0_#in~arg.base_50|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_199|, t2_funThread1of1ForFork0_~arg.offset=v_t2_funThread1of1ForFork0_~arg.offset_50, ~#mutex2~0.base=|v_~#mutex2~0.base_199|} AuxVars[] AssignedVars[~g2~0, #pthreadsMutex, t2_funThread1of1ForFork0_#t~post3, t2_funThread1of1ForFork0_~arg.base, t2_funThread1of1ForFork0_#t~nondet2, t2_funThread1of1ForFork0_#t~nondet1, t2_funThread1of1ForFork0_~arg.offset] [2022-12-05 23:42:51,834 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:42:51,835 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 85 [2022-12-05 23:42:51,835 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 8 transitions, 50 flow [2022-12-05 23:42:51,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:51,835 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:51,835 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:51,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 23:42:51,835 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-12-05 23:42:51,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:51,836 INFO L85 PathProgramCache]: Analyzing trace with hash 466822130, now seen corresponding path program 1 times [2022-12-05 23:42:51,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:51,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231947201] [2022-12-05 23:42:51,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:51,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:51,911 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-05 23:42:51,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:51,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231947201] [2022-12-05 23:42:51,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231947201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:51,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:51,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 23:42:51,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733649322] [2022-12-05 23:42:51,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:51,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-05 23:42:51,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:51,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-05 23:42:51,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-05 23:42:51,913 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 8 [2022-12-05 23:42:51,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 8 transitions, 50 flow. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:51,913 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:51,913 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 8 [2022-12-05 23:42:51,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:51,928 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-05 23:42:51,928 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-05 23:42:51,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 14 events. 2/14 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 1/15 useless extension candidates. Maximal degree in co-relation 46. Up to 12 conditions per place. [2022-12-05 23:42:51,928 INFO L137 encePairwiseOnDemand]: 3/8 looper letters, 5 selfloop transitions, 3 changer transitions 2/10 dead transitions. [2022-12-05 23:42:51,928 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 10 transitions, 73 flow [2022-12-05 23:42:51,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 23:42:51,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 23:42:51,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2022-12-05 23:42:51,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.275 [2022-12-05 23:42:51,929 INFO L175 Difference]: Start difference. First operand has 18 places, 8 transitions, 50 flow. Second operand 5 states and 11 transitions. [2022-12-05 23:42:51,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 10 transitions, 73 flow [2022-12-05 23:42:51,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 10 transitions, 68 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-05 23:42:51,930 INFO L231 Difference]: Finished difference. Result has 21 places, 7 transitions, 48 flow [2022-12-05 23:42:51,930 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=8, PETRI_DIFFERENCE_MINUEND_FLOW=35, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=48, PETRI_PLACES=21, PETRI_TRANSITIONS=7} [2022-12-05 23:42:51,931 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, -4 predicate places. [2022-12-05 23:42:51,931 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-05 23:42:51,931 INFO L89 Accepts]: Start accepts. Operand has 21 places, 7 transitions, 48 flow [2022-12-05 23:42:51,931 INFO L95 Accepts]: Finished accepts. [2022-12-05 23:42:51,931 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:51,931 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 7 transitions, 48 flow [2022-12-05 23:42:51,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 7 transitions, 48 flow [2022-12-05 23:42:51,934 INFO L130 PetriNetUnfolder]: 1/11 cut-off events. [2022-12-05 23:42:51,934 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-12-05 23:42:51,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 11 events. 1/11 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 8 event pairs, 1 based on Foata normal form. 0/11 useless extension candidates. Maximal degree in co-relation 34. Up to 9 conditions per place. [2022-12-05 23:42:51,934 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 7 transitions, 48 flow [2022-12-05 23:42:51,934 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:42:51,970 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-05 23:42:51,971 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 40 [2022-12-05 23:42:51,971 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 6 transitions, 44 flow [2022-12-05 23:42:51,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:51,971 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 23:42:51,971 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-05 23:42:51,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 23:42:51,972 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-12-05 23:42:51,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 23:42:51,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1400799400, now seen corresponding path program 1 times [2022-12-05 23:42:51,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 23:42:51,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964485752] [2022-12-05 23:42:51,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 23:42:51,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 23:42:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 23:42:52,067 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-05 23:42:52,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 23:42:52,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964485752] [2022-12-05 23:42:52,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964485752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 23:42:52,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 23:42:52,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-05 23:42:52,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878263889] [2022-12-05 23:42:52,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 23:42:52,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 23:42:52,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 23:42:52,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 23:42:52,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 23:42:52,068 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 6 [2022-12-05 23:42:52,068 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 6 transitions, 44 flow. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:52,069 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 23:42:52,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 6 [2022-12-05 23:42:52,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 23:42:52,081 INFO L130 PetriNetUnfolder]: 1/8 cut-off events. [2022-12-05 23:42:52,081 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-05 23:42:52,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 8 events. 1/8 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 5 event pairs, 0 based on Foata normal form. 1/9 useless extension candidates. Maximal degree in co-relation 32. Up to 7 conditions per place. [2022-12-05 23:42:52,081 INFO L137 encePairwiseOnDemand]: 2/6 looper letters, 0 selfloop transitions, 0 changer transitions 6/6 dead transitions. [2022-12-05 23:42:52,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 6 transitions, 53 flow [2022-12-05 23:42:52,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 23:42:52,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 23:42:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2022-12-05 23:42:52,082 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2022-12-05 23:42:52,082 INFO L175 Difference]: Start difference. First operand has 20 places, 6 transitions, 44 flow. Second operand 4 states and 7 transitions. [2022-12-05 23:42:52,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 6 transitions, 53 flow [2022-12-05 23:42:52,083 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 6 transitions, 41 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-05 23:42:52,083 INFO L231 Difference]: Finished difference. Result has 15 places, 0 transitions, 0 flow [2022-12-05 23:42:52,083 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=6, PETRI_DIFFERENCE_MINUEND_FLOW=23, PETRI_DIFFERENCE_MINUEND_PLACES=12, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=5, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=15, PETRI_TRANSITIONS=0} [2022-12-05 23:42:52,083 INFO L294 CegarLoopForPetriNet]: 25 programPoint places, -10 predicate places. [2022-12-05 23:42:52,083 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 23:42:52,084 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 15 places, 0 transitions, 0 flow [2022-12-05 23:42:52,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-05 23:42:52,084 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-05 23:42:52,084 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-05 23:42:52,084 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-05 23:42:52,084 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-05 23:42:52,084 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-05 23:42:52,084 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-05 23:42:52,085 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-05 23:42:52,085 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-05 23:42:52,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 23:42:52,087 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-05 23:42:52,088 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-12-05 23:42:52,088 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-12-05 23:42:52,088 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-05 23:42:52,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 23:42:52,088 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 23:42:52,091 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 23:42:52,091 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 23:42:52,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 11:42:52 BasicIcfg [2022-12-05 23:42:52,093 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 23:42:52,094 INFO L158 Benchmark]: Toolchain (without parser) took 8739.89ms. Allocated memory was 180.4MB in the beginning and 310.4MB in the end (delta: 130.0MB). Free memory was 139.3MB in the beginning and 266.9MB in the end (delta: -127.6MB). Peak memory consumption was 3.4MB. Max. memory is 8.0GB. [2022-12-05 23:42:52,094 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 180.4MB. Free memory was 157.0MB in the beginning and 156.9MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:42:52,094 INFO L158 Benchmark]: CACSL2BoogieTranslator took 423.61ms. Allocated memory is still 180.4MB. Free memory was 139.3MB in the beginning and 119.9MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-05 23:42:52,094 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.33ms. Allocated memory is still 180.4MB. Free memory was 119.9MB in the beginning and 118.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 23:42:52,094 INFO L158 Benchmark]: Boogie Preprocessor took 35.61ms. Allocated memory is still 180.4MB. Free memory was 117.8MB in the beginning and 116.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 23:42:52,095 INFO L158 Benchmark]: RCFGBuilder took 463.26ms. Allocated memory is still 180.4MB. Free memory was 116.2MB in the beginning and 101.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-05 23:42:52,095 INFO L158 Benchmark]: TraceAbstraction took 7743.90ms. Allocated memory was 180.4MB in the beginning and 310.4MB in the end (delta: 130.0MB). Free memory was 101.0MB in the beginning and 266.9MB in the end (delta: -165.9MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 23:42:52,096 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.18ms. Allocated memory is still 180.4MB. Free memory was 157.0MB in the beginning and 156.9MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 423.61ms. Allocated memory is still 180.4MB. Free memory was 139.3MB in the beginning and 119.9MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 68.33ms. Allocated memory is still 180.4MB. Free memory was 119.9MB in the beginning and 118.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.61ms. Allocated memory is still 180.4MB. Free memory was 117.8MB in the beginning and 116.8MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 463.26ms. Allocated memory is still 180.4MB. Free memory was 116.2MB in the beginning and 101.5MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 7743.90ms. Allocated memory was 180.4MB in the beginning and 310.4MB in the end (delta: 130.0MB). Free memory was 101.0MB in the beginning and 266.9MB in the end (delta: -165.9MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 88 PlacesBefore, 25 PlacesAfterwards, 86 TransitionsBefore, 22 TransitionsAfterwards, 1152 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 30 ConcurrentYvCompositions, 1 ChoiceCompositions, 68 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1266, independent: 1139, independent conditional: 1139, independent unconditional: 0, dependent: 127, dependent conditional: 127, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1266, independent: 1139, independent conditional: 0, independent unconditional: 1139, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1266, independent: 1139, independent conditional: 0, independent unconditional: 1139, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1266, independent: 1139, independent conditional: 0, independent unconditional: 1139, dependent: 127, dependent conditional: 0, dependent unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 834, independent: 782, independent conditional: 0, independent unconditional: 782, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 834, independent: 734, independent conditional: 0, independent unconditional: 734, dependent: 100, dependent conditional: 0, dependent unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 100, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 182, independent: 91, independent conditional: 0, independent unconditional: 91, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1266, independent: 357, independent conditional: 0, independent unconditional: 357, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 834, unknown conditional: 0, unknown unconditional: 834] , Statistics on independence cache: Total cache size (in pairs): 1330, Positive cache size: 1278, Positive conditional cache size: 0, Positive unconditional cache size: 1278, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 24 PlacesBefore, 24 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 209, independent: 144, independent conditional: 144, independent unconditional: 0, dependent: 65, dependent conditional: 65, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 209, independent: 144, independent conditional: 0, independent unconditional: 144, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 209, independent: 144, independent conditional: 0, independent unconditional: 144, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 209, independent: 144, independent conditional: 0, independent unconditional: 144, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 96, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 96, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 44, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 209, independent: 74, independent conditional: 0, independent unconditional: 74, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 96, unknown conditional: 0, unknown unconditional: 96] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 71, Positive conditional cache size: 0, Positive unconditional cache size: 71, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, 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, 28 PlacesBefore, 28 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 108, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 108, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 108, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 22, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 108, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 116, Positive cache size: 87, Positive conditional cache size: 0, Positive unconditional cache size: 87, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, 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, 28 PlacesBefore, 28 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 113, independent: 84, independent conditional: 84, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 113, independent: 84, independent conditional: 2, independent unconditional: 82, dependent: 29, dependent conditional: 7, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 120, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 36, dependent conditional: 14, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 120, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 36, dependent conditional: 14, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 33, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 33, independent: 21, independent conditional: 0, independent unconditional: 21, 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: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 34, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 34, dependent conditional: 34, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 120, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 24, dependent conditional: 2, dependent unconditional: 22, unknown: 33, unknown conditional: 12, unknown unconditional: 21] , Statistics on independence cache: Total cache size (in pairs): 149, Positive cache size: 108, Positive conditional cache size: 0, Positive unconditional cache size: 108, Negative cache size: 41, Negative conditional cache size: 12, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 32 PlacesBefore, 31 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 231, independent: 170, independent conditional: 170, independent unconditional: 0, dependent: 61, dependent conditional: 61, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 231, independent: 170, independent conditional: 65, independent unconditional: 105, dependent: 61, dependent conditional: 16, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 236, independent: 170, independent conditional: 61, independent unconditional: 109, dependent: 66, dependent conditional: 15, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 236, independent: 170, independent conditional: 61, independent unconditional: 109, dependent: 66, dependent conditional: 15, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 24, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 16, dependent conditional: 6, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 236, independent: 164, independent conditional: 55, independent unconditional: 109, dependent: 55, dependent conditional: 10, dependent unconditional: 45, unknown: 17, unknown conditional: 11, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 122, Positive conditional cache size: 6, Positive unconditional cache size: 116, Negative cache size: 52, Negative conditional cache size: 17, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 31 PlacesBefore, 30 PlacesAfterwards, 22 TransitionsBefore, 21 TransitionsAfterwards, 120 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 156, independent: 76, independent conditional: 76, independent unconditional: 0, dependent: 80, dependent conditional: 80, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 156, independent: 76, independent conditional: 17, independent unconditional: 59, dependent: 80, dependent conditional: 23, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 163, independent: 76, independent conditional: 17, independent unconditional: 59, dependent: 87, dependent conditional: 11, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 163, independent: 76, independent conditional: 17, independent unconditional: 59, dependent: 87, dependent conditional: 11, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 7, independent conditional: 5, independent unconditional: 2, dependent: 7, dependent conditional: 3, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 7, dependent conditional: 3, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, independent: 6, independent conditional: 3, independent unconditional: 3, dependent: 13, dependent conditional: 6, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 163, independent: 69, independent conditional: 12, independent unconditional: 57, dependent: 80, dependent conditional: 8, dependent unconditional: 72, unknown: 14, unknown conditional: 8, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 144, Positive conditional cache size: 11, Positive unconditional cache size: 133, Negative cache size: 59, Negative conditional cache size: 20, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 19, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 24 PlacesBefore, 24 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 43, independent: 24, independent conditional: 10, independent unconditional: 14, dependent: 19, dependent conditional: 11, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 44, independent: 24, independent conditional: 10, independent unconditional: 14, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 44, independent: 24, independent conditional: 10, independent unconditional: 14, dependent: 20, dependent conditional: 4, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 44, independent: 20, independent conditional: 6, independent unconditional: 14, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 148, Positive conditional cache size: 15, Positive unconditional cache size: 133, Negative cache size: 63, Negative conditional cache size: 24, Negative unconditional cache size: 39, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 24 PlacesBefore, 18 PlacesAfterwards, 18 TransitionsBefore, 13 TransitionsAfterwards, 36 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 5 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, independent: 68, independent conditional: 68, independent unconditional: 0, dependent: 28, dependent conditional: 28, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 96, independent: 68, independent conditional: 33, independent unconditional: 35, dependent: 28, dependent conditional: 2, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 100, independent: 68, independent conditional: 33, independent unconditional: 35, dependent: 32, dependent conditional: 2, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 100, independent: 68, independent conditional: 33, independent unconditional: 35, dependent: 32, dependent conditional: 2, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 16, independent: 13, independent conditional: 10, independent unconditional: 3, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 16, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 13, independent conditional: 10, independent unconditional: 3, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31, independent: 25, independent conditional: 19, independent unconditional: 6, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 100, independent: 55, independent conditional: 23, independent unconditional: 32, dependent: 29, dependent conditional: 1, dependent unconditional: 28, unknown: 16, unknown conditional: 11, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 253, Positive cache size: 187, Positive conditional cache size: 25, Positive unconditional cache size: 162, Negative cache size: 66, Negative conditional cache size: 25, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 18 PlacesBefore, 16 PlacesAfterwards, 10 TransitionsBefore, 8 TransitionsAfterwards, 6 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7, independent: 6, independent conditional: 4, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7, independent: 4, independent conditional: 2, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 263, Positive cache size: 197, Positive conditional cache size: 27, Positive unconditional cache size: 170, Negative cache size: 66, Negative conditional cache size: 25, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 17 PlacesBefore, 18 PlacesAfterwards, 7 TransitionsBefore, 8 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 264, Positive cache size: 198, Positive conditional cache size: 27, Positive unconditional cache size: 171, Negative cache size: 66, Negative conditional cache size: 25, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 21 PlacesBefore, 20 PlacesAfterwards, 7 TransitionsBefore, 6 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 266, Positive cache size: 200, Positive conditional cache size: 27, Positive unconditional cache size: 173, Negative cache size: 66, Negative conditional cache size: 25, Negative unconditional cache size: 41, 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, 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): 266, Positive cache size: 200, Positive conditional cache size: 27, Positive unconditional cache size: 173, Negative cache size: 66, Negative conditional cache size: 25, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: 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 3 procedures, 119 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: 7.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 117 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 117 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 299 IncrementalHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 3 mSDtfsCounter, 299 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=4, InterpolantAutomatonStates: 43, 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, 73 NumberOfCodeBlocks, 73 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 62 ConstructedInterpolants, 0 QuantifiedInterpolants, 211 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 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 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-05 23:42:52,120 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...