/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 12:27:51,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:27:51,294 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:27:51,338 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:27:51,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:27:51,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:27:51,344 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:27:51,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:27:51,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:27:51,353 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:27:51,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:27:51,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:27:51,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:27:51,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:27:51,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:27:51,356 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:27:51,357 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:27:51,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:27:51,358 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:27:51,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:27:51,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:27:51,378 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:27:51,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:27:51,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:27:51,385 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:27:51,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:27:51,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:27:51,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:27:51,387 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:27:51,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:27:51,388 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:27:51,392 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:27:51,393 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:27:51,393 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:27:51,394 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:27:51,394 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:27:51,394 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:27:51,394 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:27:51,394 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:27:51,395 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:27:51,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:27:51,397 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-13 12:27:51,420 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:27:51,421 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:27:51,422 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:27:51,422 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:27:51,422 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:27:51,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:27:51,423 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:27:51,423 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:27:51,423 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:27:51,423 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:27:51,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:27:51,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:27:51,424 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:27:51,424 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:27:51,424 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:27:51,425 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:27:51,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:27:51,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:27:51,425 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:27:51,425 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:27:51,425 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:27:51,425 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:27:51,425 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:27:51,425 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:27:51,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:27:51,426 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:27:51,426 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:27:51,426 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:27:51,426 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-13 12:27:51,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:27:51,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:27:51,679 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:27:51,680 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:27:51,680 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:27:51,681 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-13 12:27:52,699 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:27:52,957 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:27:52,958 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_29-multiple-protecting2-vesal_true.i [2022-12-13 12:27:52,987 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77c84c5ac/8420d141a1894fc9811bcd21663f2dfd/FLAG2e6d7b28d [2022-12-13 12:27:52,999 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77c84c5ac/8420d141a1894fc9811bcd21663f2dfd [2022-12-13 12:27:53,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:27:53,002 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:27:53,004 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:27:53,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:27:53,006 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:27:53,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:27:53" (1/1) ... [2022-12-13 12:27:53,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5de260ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:53, skipping insertion in model container [2022-12-13 12:27:53,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:27:53" (1/1) ... [2022-12-13 12:27:53,011 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:27:53,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:27:53,137 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-13 12:27:53,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:27:53,257 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:27:53,266 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-13 12:27:53,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:27:53,326 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:27:53,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:53 WrapperNode [2022-12-13 12:27:53,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:27:53,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:27:53,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:27:53,329 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:27:53,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:53" (1/1) ... [2022-12-13 12:27:53,357 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:53" (1/1) ... [2022-12-13 12:27:53,378 INFO L138 Inliner]: procedures = 162, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 77 [2022-12-13 12:27:53,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:27:53,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:27:53,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:27:53,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:27:53,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:53" (1/1) ... [2022-12-13 12:27:53,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:53" (1/1) ... [2022-12-13 12:27:53,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:53" (1/1) ... [2022-12-13 12:27:53,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:53" (1/1) ... [2022-12-13 12:27:53,405 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:53" (1/1) ... [2022-12-13 12:27:53,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:53" (1/1) ... [2022-12-13 12:27:53,407 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:53" (1/1) ... [2022-12-13 12:27:53,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:53" (1/1) ... [2022-12-13 12:27:53,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:27:53,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:27:53,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:27:53,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:27:53,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:53" (1/1) ... [2022-12-13 12:27:53,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:27:53,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:27:53,461 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-13 12:27:53,475 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-13 12:27:53,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 12:27:53,496 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2022-12-13 12:27:53,497 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2022-12-13 12:27:53,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:27:53,497 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 12:27:53,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:27:53,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:27:53,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:27:53,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:27:53,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:27:53,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:27:53,498 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 12:27:53,627 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:27:53,628 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:27:53,801 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:27:53,806 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:27:53,806 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:27:53,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:27:53 BoogieIcfgContainer [2022-12-13 12:27:53,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:27:53,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:27:53,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:27:53,812 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:27:53,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:27:53" (1/3) ... [2022-12-13 12:27:53,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1301acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:27:53, skipping insertion in model container [2022-12-13 12:27:53,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:27:53" (2/3) ... [2022-12-13 12:27:53,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1301acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:27:53, skipping insertion in model container [2022-12-13 12:27:53,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:27:53" (3/3) ... [2022-12-13 12:27:53,813 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_29-multiple-protecting2-vesal_true.i [2022-12-13 12:27:53,826 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:27:53,826 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-12-13 12:27:53,826 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:27:53,895 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-12-13 12:27:53,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 101 transitions, 210 flow [2022-12-13 12:27:53,991 INFO L130 PetriNetUnfolder]: 3/100 cut-off events. [2022-12-13 12:27:53,991 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-13 12:27:53,995 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-13 12:27:53,995 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 101 transitions, 210 flow [2022-12-13 12:27:53,999 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 86 transitions, 175 flow [2022-12-13 12:27:54,000 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:27:54,025 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 86 transitions, 175 flow [2022-12-13 12:27:54,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 86 transitions, 175 flow [2022-12-13 12:27:54,056 INFO L130 PetriNetUnfolder]: 2/86 cut-off events. [2022-12-13 12:27:54,057 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:27:54,057 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-13 12:27:54,059 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 86 transitions, 175 flow [2022-12-13 12:27:54,059 INFO L226 LiptonReduction]: Number of co-enabled transitions 1152 [2022-12-13 12:27:56,892 INFO L241 LiptonReduction]: Total number of compositions: 70 [2022-12-13 12:27:56,910 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:27:56,915 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;@ccaedc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:27:56,916 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 12:27:56,918 INFO L130 PetriNetUnfolder]: 0/9 cut-off events. [2022-12-13 12:27:56,918 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:27:56,918 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:27:56,919 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 12:27:56,919 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-13 12:27:56,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:27:56,922 INFO L85 PathProgramCache]: Analyzing trace with hash 10514847, now seen corresponding path program 1 times [2022-12-13 12:27:56,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:27:56,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504036681] [2022-12-13 12:27:56,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:27:56,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:27:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:27:57,092 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-13 12:27:57,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:27:57,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504036681] [2022-12-13 12:27:57,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504036681] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:27:57,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:27:57,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:27:57,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003642523] [2022-12-13 12:27:57,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:27:57,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 12:27:57,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:27:57,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 12:27:57,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:27:57,117 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 31 [2022-12-13 12:27:57,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 65 flow. Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:27:57,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:27:57,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 31 [2022-12-13 12:27:57,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:27:57,196 INFO L130 PetriNetUnfolder]: 96/251 cut-off events. [2022-12-13 12:27:57,196 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:27:57,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 251 events. 96/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1190 event pairs, 96 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 461. Up to 215 conditions per place. [2022-12-13 12:27:57,220 INFO L137 encePairwiseOnDemand]: 30/31 looper letters, 22 selfloop transitions, 0 changer transitions 0/30 dead transitions. [2022-12-13 12:27:57,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 107 flow [2022-12-13 12:27:57,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 12:27:57,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 12:27:57,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 39 transitions. [2022-12-13 12:27:57,228 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6290322580645161 [2022-12-13 12:27:57,229 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 65 flow. Second operand 2 states and 39 transitions. [2022-12-13 12:27:57,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 107 flow [2022-12-13 12:27:57,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 30 transitions, 106 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:27:57,231 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 62 flow [2022-12-13 12:27:57,233 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=62, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2022-12-13 12:27:57,235 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2022-12-13 12:27:57,235 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:27:57,236 INFO L89 Accepts]: Start accepts. Operand has 34 places, 30 transitions, 62 flow [2022-12-13 12:27:57,237 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:27:57,237 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:27:57,237 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 30 transitions, 62 flow [2022-12-13 12:27:57,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 30 transitions, 62 flow [2022-12-13 12:27:57,249 INFO L130 PetriNetUnfolder]: 0/30 cut-off events. [2022-12-13 12:27:57,249 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:27:57,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 61 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-13 12:27:57,251 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 30 transitions, 62 flow [2022-12-13 12:27:57,252 INFO L226 LiptonReduction]: Number of co-enabled transitions 360 [2022-12-13 12:27:57,352 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:27:57,354 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 119 [2022-12-13 12:27:57,356 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 30 transitions, 62 flow [2022-12-13 12:27:57,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:27:57,357 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:27:57,357 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 12:27:57,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:27:57,357 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-13 12:27:57,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:27:57,358 INFO L85 PathProgramCache]: Analyzing trace with hash 325897514, now seen corresponding path program 1 times [2022-12-13 12:27:57,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:27:57,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829485068] [2022-12-13 12:27:57,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:27:57,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:27:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:27:57,511 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-13 12:27:57,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:27:57,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829485068] [2022-12-13 12:27:57,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829485068] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:27:57,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:27:57,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:27:57,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867600236] [2022-12-13 12:27:57,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:27:57,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:27:57,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:27:57,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:27:57,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:27:57,521 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2022-12-13 12:27:57,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:27:57,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:27:57,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2022-12-13 12:27:57,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:27:57,584 INFO L130 PetriNetUnfolder]: 96/263 cut-off events. [2022-12-13 12:27:57,584 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:27:57,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 263 events. 96/263 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1316 event pairs, 35 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 486. Up to 145 conditions per place. [2022-12-13 12:27:57,587 INFO L137 encePairwiseOnDemand]: 23/30 looper letters, 31 selfloop transitions, 6 changer transitions 0/44 dead transitions. [2022-12-13 12:27:57,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 44 transitions, 164 flow [2022-12-13 12:27:57,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:27:57,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:27:57,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2022-12-13 12:27:57,590 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6555555555555556 [2022-12-13 12:27:57,590 INFO L175 Difference]: Start difference. First operand has 33 places, 30 transitions, 62 flow. Second operand 3 states and 59 transitions. [2022-12-13 12:27:57,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 44 transitions, 164 flow [2022-12-13 12:27:57,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 164 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:27:57,591 INFO L231 Difference]: Finished difference. Result has 37 places, 33 transitions, 100 flow [2022-12-13 12:27:57,591 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=37, PETRI_TRANSITIONS=33} [2022-12-13 12:27:57,592 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2022-12-13 12:27:57,592 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:27:57,592 INFO L89 Accepts]: Start accepts. Operand has 37 places, 33 transitions, 100 flow [2022-12-13 12:27:57,592 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:27:57,592 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:27:57,592 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 33 transitions, 100 flow [2022-12-13 12:27:57,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 33 transitions, 100 flow [2022-12-13 12:27:57,597 INFO L130 PetriNetUnfolder]: 4/53 cut-off events. [2022-12-13 12:27:57,597 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 12:27:57,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 53 events. 4/53 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 214 event pairs, 2 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 82. Up to 17 conditions per place. [2022-12-13 12:27:57,598 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 33 transitions, 100 flow [2022-12-13 12:27:57,598 INFO L226 LiptonReduction]: Number of co-enabled transitions 332 [2022-12-13 12:27:57,626 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:27:57,628 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 36 [2022-12-13 12:27:57,628 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 33 transitions, 100 flow [2022-12-13 12:27:57,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:27:57,628 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:27:57,628 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 12:27:57,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:27:57,629 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-13 12:27:57,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:27:57,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1512886802, now seen corresponding path program 1 times [2022-12-13 12:27:57,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:27:57,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948440159] [2022-12-13 12:27:57,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:27:57,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:27:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:27:57,708 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-13 12:27:57,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:27:57,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948440159] [2022-12-13 12:27:57,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948440159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:27:57,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:27:57,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:27:57,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760180644] [2022-12-13 12:27:57,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:27:57,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:27:57,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:27:57,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:27:57,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:27:57,712 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2022-12-13 12:27:57,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 33 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:27:57,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:27:57,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2022-12-13 12:27:57,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:27:57,765 INFO L130 PetriNetUnfolder]: 90/244 cut-off events. [2022-12-13 12:27:57,765 INFO L131 PetriNetUnfolder]: For 41/41 co-relation queries the response was YES. [2022-12-13 12:27:57,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 538 conditions, 244 events. 90/244 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1178 event pairs, 29 based on Foata normal form. 5/196 useless extension candidates. Maximal degree in co-relation 526. Up to 136 conditions per place. [2022-12-13 12:27:57,769 INFO L137 encePairwiseOnDemand]: 25/30 looper letters, 34 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2022-12-13 12:27:57,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 202 flow [2022-12-13 12:27:57,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:27:57,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:27:57,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-12-13 12:27:57,771 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6444444444444445 [2022-12-13 12:27:57,771 INFO L175 Difference]: Start difference. First operand has 37 places, 33 transitions, 100 flow. Second operand 3 states and 58 transitions. [2022-12-13 12:27:57,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 202 flow [2022-12-13 12:27:57,773 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 45 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 12:27:57,774 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 92 flow [2022-12-13 12:27:57,774 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2022-12-13 12:27:57,775 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2022-12-13 12:27:57,775 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:27:57,775 INFO L89 Accepts]: Start accepts. Operand has 37 places, 32 transitions, 92 flow [2022-12-13 12:27:57,775 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:27:57,775 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:27:57,775 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 32 transitions, 92 flow [2022-12-13 12:27:57,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 32 transitions, 92 flow [2022-12-13 12:27:57,780 INFO L130 PetriNetUnfolder]: 2/44 cut-off events. [2022-12-13 12:27:57,780 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 12:27:57,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 44 events. 2/44 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 153 event pairs, 2 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 64. Up to 13 conditions per place. [2022-12-13 12:27:57,781 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 32 transitions, 92 flow [2022-12-13 12:27:57,781 INFO L226 LiptonReduction]: Number of co-enabled transitions 320 [2022-12-13 12:27:57,790 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:27:57,791 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-13 12:27:57,791 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 92 flow [2022-12-13 12:27:57,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:27:57,791 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:27:57,791 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:27:57,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:27:57,792 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-13 12:27:57,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:27:57,792 INFO L85 PathProgramCache]: Analyzing trace with hash -2108695724, now seen corresponding path program 1 times [2022-12-13 12:27:57,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:27:57,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846623412] [2022-12-13 12:27:57,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:27:57,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:27:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:27:57,868 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-13 12:27:57,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:27:57,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846623412] [2022-12-13 12:27:57,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846623412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:27:57,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:27:57,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:27:57,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169933613] [2022-12-13 12:27:57,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:27:57,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:27:57,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:27:57,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:27:57,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:27:57,871 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2022-12-13 12:27:57,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-13 12:27:57,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:27:57,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2022-12-13 12:27:57,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:27:57,950 INFO L130 PetriNetUnfolder]: 79/223 cut-off events. [2022-12-13 12:27:57,950 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-13 12:27:57,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 478 conditions, 223 events. 79/223 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1068 event pairs, 17 based on Foata normal form. 10/187 useless extension candidates. Maximal degree in co-relation 466. Up to 64 conditions per place. [2022-12-13 12:27:57,954 INFO L137 encePairwiseOnDemand]: 20/30 looper letters, 39 selfloop transitions, 10 changer transitions 3/58 dead transitions. [2022-12-13 12:27:57,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 58 transitions, 250 flow [2022-12-13 12:27:57,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:27:57,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 12:27:57,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-12-13 12:27:57,957 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5277777777777778 [2022-12-13 12:27:57,957 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 92 flow. Second operand 6 states and 95 transitions. [2022-12-13 12:27:57,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 58 transitions, 250 flow [2022-12-13 12:27:57,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 58 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:27:57,959 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 136 flow [2022-12-13 12:27:57,960 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2022-12-13 12:27:57,961 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2022-12-13 12:27:57,961 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:27:57,961 INFO L89 Accepts]: Start accepts. Operand has 46 places, 30 transitions, 136 flow [2022-12-13 12:27:57,962 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:27:57,962 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:27:57,962 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 30 transitions, 136 flow [2022-12-13 12:27:57,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 30 transitions, 136 flow [2022-12-13 12:27:57,965 INFO L130 PetriNetUnfolder]: 0/38 cut-off events. [2022-12-13 12:27:57,965 INFO L131 PetriNetUnfolder]: For 17/18 co-relation queries the response was YES. [2022-12-13 12:27:57,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 38 events. 0/38 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 129 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 9 conditions per place. [2022-12-13 12:27:57,966 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 30 transitions, 136 flow [2022-12-13 12:27:57,966 INFO L226 LiptonReduction]: Number of co-enabled transitions 254 [2022-12-13 12:27:58,101 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:27:58,104 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 143 [2022-12-13 12:27:58,104 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 134 flow [2022-12-13 12:27:58,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-13 12:27:58,104 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:27:58,105 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:27:58,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:27:58,105 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-13 12:27:58,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:27:58,105 INFO L85 PathProgramCache]: Analyzing trace with hash -340110520, now seen corresponding path program 1 times [2022-12-13 12:27:58,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:27:58,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801323535] [2022-12-13 12:27:58,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:27:58,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:27:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:27:58,165 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-13 12:27:58,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:27:58,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801323535] [2022-12-13 12:27:58,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801323535] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:27:58,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:27:58,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:27:58,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596463282] [2022-12-13 12:27:58,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:27:58,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:27:58,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:27:58,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:27:58,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:27:58,166 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 26 [2022-12-13 12:27:58,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 134 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:27:58,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:27:58,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 26 [2022-12-13 12:27:58,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:27:58,203 INFO L130 PetriNetUnfolder]: 59/162 cut-off events. [2022-12-13 12:27:58,204 INFO L131 PetriNetUnfolder]: For 201/201 co-relation queries the response was YES. [2022-12-13 12:27:58,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 162 events. 59/162 cut-off events. For 201/201 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 674 event pairs, 14 based on Foata normal form. 9/148 useless extension candidates. Maximal degree in co-relation 443. Up to 121 conditions per place. [2022-12-13 12:27:58,204 INFO L137 encePairwiseOnDemand]: 22/26 looper letters, 21 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2022-12-13 12:27:58,204 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 30 transitions, 162 flow [2022-12-13 12:27:58,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:27:58,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:27:58,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-12-13 12:27:58,207 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47115384615384615 [2022-12-13 12:27:58,207 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 134 flow. Second operand 4 states and 49 transitions. [2022-12-13 12:27:58,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 30 transitions, 162 flow [2022-12-13 12:27:58,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 30 transitions, 134 flow, removed 5 selfloop flow, removed 7 redundant places. [2022-12-13 12:27:58,210 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 82 flow [2022-12-13 12:27:58,210 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2022-12-13 12:27:58,212 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-12-13 12:27:58,212 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:27:58,212 INFO L89 Accepts]: Start accepts. Operand has 36 places, 25 transitions, 82 flow [2022-12-13 12:27:58,212 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:27:58,212 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:27:58,213 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 25 transitions, 82 flow [2022-12-13 12:27:58,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 25 transitions, 82 flow [2022-12-13 12:27:58,216 INFO L130 PetriNetUnfolder]: 0/27 cut-off events. [2022-12-13 12:27:58,216 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-13 12:27:58,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 27 events. 0/27 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 63 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 5 conditions per place. [2022-12-13 12:27:58,216 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 25 transitions, 82 flow [2022-12-13 12:27:58,216 INFO L226 LiptonReduction]: Number of co-enabled transitions 224 [2022-12-13 12:27:58,236 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:27:58,238 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 26 [2022-12-13 12:27:58,240 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 82 flow [2022-12-13 12:27:58,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:27:58,240 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:27:58,240 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:27:58,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:27:58,241 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-12-13 12:27:58,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:27:58,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1964132827, now seen corresponding path program 1 times [2022-12-13 12:27:58,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:27:58,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193564820] [2022-12-13 12:27:58,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:27:58,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:27:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:27:58,291 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-13 12:27:58,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:27:58,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193564820] [2022-12-13 12:27:58,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193564820] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:27:58,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:27:58,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:27:58,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57129789] [2022-12-13 12:27:58,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:27:58,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:27:58,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:27:58,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:27:58,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:27:58,292 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-13 12:27:58,292 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 82 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-13 12:27:58,292 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:27:58,292 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-13 12:27:58,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:27:58,336 INFO L130 PetriNetUnfolder]: 50/166 cut-off events. [2022-12-13 12:27:58,336 INFO L131 PetriNetUnfolder]: For 97/97 co-relation queries the response was YES. [2022-12-13 12:27:58,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 166 events. 50/166 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 710 event pairs, 18 based on Foata normal form. 33/160 useless extension candidates. Maximal degree in co-relation 401. Up to 89 conditions per place. [2022-12-13 12:27:58,337 INFO L137 encePairwiseOnDemand]: 10/25 looper letters, 19 selfloop transitions, 11 changer transitions 5/35 dead transitions. [2022-12-13 12:27:58,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 35 transitions, 181 flow [2022-12-13 12:27:58,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:27:58,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:27:58,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2022-12-13 12:27:58,338 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2022-12-13 12:27:58,339 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 82 flow. Second operand 3 states and 44 transitions. [2022-12-13 12:27:58,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 35 transitions, 181 flow [2022-12-13 12:27:58,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 164 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 12:27:58,340 INFO L231 Difference]: Finished difference. Result has 35 places, 24 transitions, 103 flow [2022-12-13 12:27:58,340 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2022-12-13 12:27:58,340 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2022-12-13 12:27:58,340 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:27:58,340 INFO L89 Accepts]: Start accepts. Operand has 35 places, 24 transitions, 103 flow [2022-12-13 12:27:58,341 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:27:58,341 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:27:58,341 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 24 transitions, 103 flow [2022-12-13 12:27:58,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 24 transitions, 103 flow [2022-12-13 12:27:58,345 INFO L130 PetriNetUnfolder]: 8/72 cut-off events. [2022-12-13 12:27:58,345 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-13 12:27:58,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 72 events. 8/72 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 287 event pairs, 5 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 156. Up to 29 conditions per place. [2022-12-13 12:27:58,346 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 24 transitions, 103 flow [2022-12-13 12:27:58,346 INFO L226 LiptonReduction]: Number of co-enabled transitions 64 [2022-12-13 12:27:58,658 INFO L241 LiptonReduction]: Total number of compositions: 8 [2022-12-13 12:27:58,659 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 319 [2022-12-13 12:27:58,659 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 15 transitions, 77 flow [2022-12-13 12:27:58,659 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-13 12:27:58,659 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:27:58,659 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 12:27:58,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:27:58,659 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-12-13 12:27:58,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:27:58,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1513055515, now seen corresponding path program 1 times [2022-12-13 12:27:58,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:27:58,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002342019] [2022-12-13 12:27:58,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:27:58,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:27:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:27:58,698 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-13 12:27:58,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:27:58,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002342019] [2022-12-13 12:27:58,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002342019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:27:58,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:27:58,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:27:58,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139934971] [2022-12-13 12:27:58,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:27:58,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:27:58,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:27:58,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:27:58,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:27:58,699 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 12 [2022-12-13 12:27:58,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 15 transitions, 77 flow. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-13 12:27:58,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:27:58,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 12 [2022-12-13 12:27:58,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:27:58,718 INFO L130 PetriNetUnfolder]: 9/37 cut-off events. [2022-12-13 12:27:58,718 INFO L131 PetriNetUnfolder]: For 61/66 co-relation queries the response was YES. [2022-12-13 12:27:58,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 37 events. 9/37 cut-off events. For 61/66 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 97 event pairs, 0 based on Foata normal form. 5/38 useless extension candidates. Maximal degree in co-relation 126. Up to 25 conditions per place. [2022-12-13 12:27:58,718 INFO L137 encePairwiseOnDemand]: 7/12 looper letters, 12 selfloop transitions, 4 changer transitions 0/19 dead transitions. [2022-12-13 12:27:58,718 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 19 transitions, 124 flow [2022-12-13 12:27:58,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:27:58,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:27:58,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-12-13 12:27:58,719 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-13 12:27:58,719 INFO L175 Difference]: Start difference. First operand has 22 places, 15 transitions, 77 flow. Second operand 5 states and 27 transitions. [2022-12-13 12:27:58,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 19 transitions, 124 flow [2022-12-13 12:27:58,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 19 transitions, 105 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-12-13 12:27:58,720 INFO L231 Difference]: Finished difference. Result has 23 places, 15 transitions, 73 flow [2022-12-13 12:27:58,720 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=12, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=73, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2022-12-13 12:27:58,721 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, -11 predicate places. [2022-12-13 12:27:58,721 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:27:58,721 INFO L89 Accepts]: Start accepts. Operand has 23 places, 15 transitions, 73 flow [2022-12-13 12:27:58,721 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:27:58,721 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:27:58,721 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 15 transitions, 73 flow [2022-12-13 12:27:58,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 15 transitions, 73 flow [2022-12-13 12:27:58,723 INFO L130 PetriNetUnfolder]: 5/28 cut-off events. [2022-12-13 12:27:58,723 INFO L131 PetriNetUnfolder]: For 15/16 co-relation queries the response was YES. [2022-12-13 12:27:58,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82 conditions, 28 events. 5/28 cut-off events. For 15/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 77 event pairs, 5 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 72. Up to 20 conditions per place. [2022-12-13 12:27:58,724 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 15 transitions, 73 flow [2022-12-13 12:27:58,724 INFO L226 LiptonReduction]: Number of co-enabled transitions 20 [2022-12-13 12:27:58,734 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:27:58,734 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 12:27:58,735 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 15 transitions, 73 flow [2022-12-13 12:27:58,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 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-13 12:27:58,735 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:27:58,735 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:27:58,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:27:58,735 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-13 12:27:58,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:27:58,735 INFO L85 PathProgramCache]: Analyzing trace with hash -340120862, now seen corresponding path program 1 times [2022-12-13 12:27:58,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:27:58,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238836849] [2022-12-13 12:27:58,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:27:58,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:27:58,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:27:58,787 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-13 12:27:58,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:27:58,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238836849] [2022-12-13 12:27:58,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238836849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:27:58,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:27:58,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:27:58,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501105988] [2022-12-13 12:27:58,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:27:58,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:27:58,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:27:58,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:27:58,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:27:58,788 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 11 [2022-12-13 12:27:58,789 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 15 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 2.3333333333333335) 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-13 12:27:58,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:27:58,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 11 [2022-12-13 12:27:58,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:27:58,806 INFO L130 PetriNetUnfolder]: 10/36 cut-off events. [2022-12-13 12:27:58,806 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-13 12:27:58,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 36 events. 10/36 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 85 event pairs, 6 based on Foata normal form. 3/33 useless extension candidates. Maximal degree in co-relation 113. Up to 22 conditions per place. [2022-12-13 12:27:58,807 INFO L137 encePairwiseOnDemand]: 6/11 looper letters, 8 selfloop transitions, 5 changer transitions 0/13 dead transitions. [2022-12-13 12:27:58,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 13 transitions, 85 flow [2022-12-13 12:27:58,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:27:58,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:27:58,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-12-13 12:27:58,807 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2022-12-13 12:27:58,808 INFO L175 Difference]: Start difference. First operand has 24 places, 15 transitions, 73 flow. Second operand 3 states and 15 transitions. [2022-12-13 12:27:58,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 13 transitions, 85 flow [2022-12-13 12:27:58,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 13 transitions, 74 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-13 12:27:58,808 INFO L231 Difference]: Finished difference. Result has 21 places, 11 transitions, 52 flow [2022-12-13 12:27:58,808 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=11, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=11, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=21, PETRI_TRANSITIONS=11} [2022-12-13 12:27:58,809 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, -13 predicate places. [2022-12-13 12:27:58,809 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:27:58,809 INFO L89 Accepts]: Start accepts. Operand has 21 places, 11 transitions, 52 flow [2022-12-13 12:27:58,809 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:27:58,809 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:27:58,809 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 21 places, 11 transitions, 52 flow [2022-12-13 12:27:58,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 11 transitions, 52 flow [2022-12-13 12:27:58,812 INFO L130 PetriNetUnfolder]: 5/26 cut-off events. [2022-12-13 12:27:58,812 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-13 12:27:58,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69 conditions, 26 events. 5/26 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 55 event pairs, 5 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 62. Up to 17 conditions per place. [2022-12-13 12:27:58,812 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 21 places, 11 transitions, 52 flow [2022-12-13 12:27:58,812 INFO L226 LiptonReduction]: Number of co-enabled transitions 10 [2022-12-13 12:27:58,916 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:27:58,917 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 108 [2022-12-13 12:27:58,917 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 9 transitions, 48 flow [2022-12-13 12:27:58,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) 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-13 12:27:58,917 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:27:58,917 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:27:58,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 12:27:58,918 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-13 12:27:58,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:27:58,918 INFO L85 PathProgramCache]: Analyzing trace with hash -274383470, now seen corresponding path program 1 times [2022-12-13 12:27:58,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:27:58,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007947036] [2022-12-13 12:27:58,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:27:58,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:27:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:27:58,980 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-13 12:27:58,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:27:58,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007947036] [2022-12-13 12:27:58,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007947036] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:27:58,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:27:58,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 12:27:58,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919599962] [2022-12-13 12:27:58,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:27:58,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:27:58,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:27:58,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:27:58,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 12:27:58,981 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 9 [2022-12-13 12:27:58,982 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 9 transitions, 48 flow. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:27:58,982 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:27:58,982 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 9 [2022-12-13 12:27:58,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:27:58,996 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-13 12:27:58,996 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-13 12:27:58,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 24 events. 4/24 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 57 event pairs, 1 based on Foata normal form. 3/24 useless extension candidates. Maximal degree in co-relation 84. Up to 20 conditions per place. [2022-12-13 12:27:58,997 INFO L137 encePairwiseOnDemand]: 4/9 looper letters, 6 selfloop transitions, 3 changer transitions 3/13 dead transitions. [2022-12-13 12:27:58,997 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 13 transitions, 92 flow [2022-12-13 12:27:58,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:27:58,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 12:27:58,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2022-12-13 12:27:58,998 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4 [2022-12-13 12:27:58,998 INFO L175 Difference]: Start difference. First operand has 19 places, 9 transitions, 48 flow. Second operand 5 states and 18 transitions. [2022-12-13 12:27:58,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 13 transitions, 92 flow [2022-12-13 12:27:58,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 13 transitions, 85 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:27:58,998 INFO L231 Difference]: Finished difference. Result has 24 places, 9 transitions, 56 flow [2022-12-13 12:27:58,998 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=9, PETRI_DIFFERENCE_MINUEND_FLOW=43, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=56, PETRI_PLACES=24, PETRI_TRANSITIONS=9} [2022-12-13 12:27:58,999 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, -10 predicate places. [2022-12-13 12:27:58,999 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:27:58,999 INFO L89 Accepts]: Start accepts. Operand has 24 places, 9 transitions, 56 flow [2022-12-13 12:27:58,999 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:27:58,999 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:27:58,999 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 9 transitions, 56 flow [2022-12-13 12:27:59,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 9 transitions, 56 flow [2022-12-13 12:27:59,002 INFO L130 PetriNetUnfolder]: 1/17 cut-off events. [2022-12-13 12:27:59,002 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-13 12:27:59,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 17 events. 1/17 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 27 event pairs, 1 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 54. Up to 13 conditions per place. [2022-12-13 12:27:59,002 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 24 places, 9 transitions, 56 flow [2022-12-13 12:27:59,002 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 12:27:59,090 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [335] L690-->L694: Formula: (let ((.cse0 (select |v_#pthreadsMutex_1562| |v_~#__global_lock~0.base_493|))) (and (= (select .cse0 |v_~#__global_lock~0.offset_493|) 0) (= (+ v_~g2~0_625 1) v_~g2~0_626) (= (let ((.cse1 (store |v_#pthreadsMutex_1562| |v_~#__global_lock~0.base_493| (store .cse0 |v_~#__global_lock~0.offset_493| 0)))) (store .cse1 |v_~#mutex2~0.base_257| (store (select .cse1 |v_~#mutex2~0.base_257|) |v_~#mutex2~0.offset_257| 0))) |v_#pthreadsMutex_1560|))) InVars {~g2~0=v_~g2~0_626, #pthreadsMutex=|v_#pthreadsMutex_1562|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_493|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_257|, ~#mutex2~0.base=|v_~#mutex2~0.base_257|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_493|} OutVars{~g2~0=v_~g2~0_625, #pthreadsMutex=|v_#pthreadsMutex_1560|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_493|, t2_funThread1of1ForFork0_#t~nondet4=|v_t2_funThread1of1ForFork0_#t~nondet4_116|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_257|, ~#mutex2~0.base=|v_~#mutex2~0.base_257|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_493|, t2_funThread1of1ForFork0_#t~post5=|v_t2_funThread1of1ForFork0_#t~post5_110|} AuxVars[] AssignedVars[~g2~0, #pthreadsMutex, t2_funThread1of1ForFork0_#t~nondet4, t2_funThread1of1ForFork0_#t~post5] and [333] L704-->ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#pthreadsMutex_1511| |v_~#mutex2~0.base_241|))) (let ((.cse2 (store |v_#pthreadsMutex_1511| |v_~#mutex2~0.base_241| (store .cse0 |v_~#mutex2~0.offset_241| 1)))) (let ((.cse1 (select .cse2 |v_~#__global_lock~0.base_485|))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_276| 0) (= (select .cse0 |v_~#mutex2~0.offset_241|) 0) (= (select .cse1 |v_~#__global_lock~0.offset_485|) 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_347| (ite (= v_~g2~0_613 0) 1 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_347| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_276|) (= |v_#pthreadsMutex_1509| (store .cse2 |v_~#__global_lock~0.base_485| (store .cse1 |v_~#__global_lock~0.offset_485| 1))))))) InVars {~g2~0=v_~g2~0_613, #pthreadsMutex=|v_#pthreadsMutex_1511|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_485|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_241|, ~#mutex2~0.base=|v_~#mutex2~0.base_241|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_485|} OutVars{~g2~0=v_~g2~0_613, #pthreadsMutex=|v_#pthreadsMutex_1509|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_114|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_174|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_347|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_485|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_241|, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_276|, ~#mutex2~0.base=|v_~#mutex2~0.base_241|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_485|} 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] [2022-12-13 12:27:59,170 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [336] L690-->t2_funEXIT: Formula: (let ((.cse1 (select |v_#pthreadsMutex_1568| |v_~#__global_lock~0.base_495|))) (and (= (let ((.cse0 (store |v_#pthreadsMutex_1568| |v_~#__global_lock~0.base_495| (store .cse1 |v_~#__global_lock~0.offset_495| 0)))) (store .cse0 |v_~#mutex2~0.base_259| (store (select .cse0 |v_~#mutex2~0.base_259|) |v_~#mutex2~0.offset_259| 0))) |v_#pthreadsMutex_1566|) (= |v_t2_funThread1of1ForFork0_#res.base_49| 0) (= |v_t2_funThread1of1ForFork0_#res.offset_49| 0) (= v_~g2~0_630 (+ v_~g2~0_629 1)) (= (select .cse1 |v_~#__global_lock~0.offset_495|) 0))) InVars {~g2~0=v_~g2~0_630, #pthreadsMutex=|v_#pthreadsMutex_1568|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_495|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_259|, ~#mutex2~0.base=|v_~#mutex2~0.base_259|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_495|} OutVars{~g2~0=v_~g2~0_629, #pthreadsMutex=|v_#pthreadsMutex_1566|, t2_funThread1of1ForFork0_#res.offset=|v_t2_funThread1of1ForFork0_#res.offset_49|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_495|, t2_funThread1of1ForFork0_#t~nondet4=|v_t2_funThread1of1ForFork0_#t~nondet4_118|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_259|, ~#mutex2~0.base=|v_~#mutex2~0.base_259|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_495|, t2_funThread1of1ForFork0_#t~post5=|v_t2_funThread1of1ForFork0_#t~post5_112|, t2_funThread1of1ForFork0_#res.base=|v_t2_funThread1of1ForFork0_#res.base_49|} AuxVars[] AssignedVars[~g2~0, #pthreadsMutex, t2_funThread1of1ForFork0_#res.offset, t2_funThread1of1ForFork0_#t~nondet4, t2_funThread1of1ForFork0_#t~post5, t2_funThread1of1ForFork0_#res.base] and [333] L704-->ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#pthreadsMutex_1511| |v_~#mutex2~0.base_241|))) (let ((.cse2 (store |v_#pthreadsMutex_1511| |v_~#mutex2~0.base_241| (store .cse0 |v_~#mutex2~0.offset_241| 1)))) (let ((.cse1 (select .cse2 |v_~#__global_lock~0.base_485|))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_276| 0) (= (select .cse0 |v_~#mutex2~0.offset_241|) 0) (= (select .cse1 |v_~#__global_lock~0.offset_485|) 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_347| (ite (= v_~g2~0_613 0) 1 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_347| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_276|) (= |v_#pthreadsMutex_1509| (store .cse2 |v_~#__global_lock~0.base_485| (store .cse1 |v_~#__global_lock~0.offset_485| 1))))))) InVars {~g2~0=v_~g2~0_613, #pthreadsMutex=|v_#pthreadsMutex_1511|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_485|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_241|, ~#mutex2~0.base=|v_~#mutex2~0.base_241|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_485|} OutVars{~g2~0=v_~g2~0_613, #pthreadsMutex=|v_#pthreadsMutex_1509|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_114|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_174|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_347|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_485|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_241|, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_276|, ~#mutex2~0.base=|v_~#mutex2~0.base_241|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_485|} 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] [2022-12-13 12:27:59,266 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [337] L690-->t2_funFINAL: Formula: (let ((.cse0 (select |v_#pthreadsMutex_1574| |v_~#__global_lock~0.base_497|))) (and (= 0 (select .cse0 |v_~#__global_lock~0.offset_497|)) (= (+ v_~g2~0_633 1) v_~g2~0_634) (= |v_t2_funThread1of1ForFork0_#res.offset_51| 0) (= |v_#pthreadsMutex_1572| (let ((.cse1 (store |v_#pthreadsMutex_1574| |v_~#__global_lock~0.base_497| (store .cse0 |v_~#__global_lock~0.offset_497| 0)))) (store .cse1 |v_~#mutex2~0.base_261| (store (select .cse1 |v_~#mutex2~0.base_261|) |v_~#mutex2~0.offset_261| 0)))) (= |v_t2_funThread1of1ForFork0_#res.base_51| 0))) InVars {~g2~0=v_~g2~0_634, #pthreadsMutex=|v_#pthreadsMutex_1574|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_497|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_261|, ~#mutex2~0.base=|v_~#mutex2~0.base_261|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_497|} OutVars{~g2~0=v_~g2~0_633, #pthreadsMutex=|v_#pthreadsMutex_1572|, t2_funThread1of1ForFork0_#res.offset=|v_t2_funThread1of1ForFork0_#res.offset_51|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_497|, t2_funThread1of1ForFork0_#t~nondet4=|v_t2_funThread1of1ForFork0_#t~nondet4_120|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_261|, ~#mutex2~0.base=|v_~#mutex2~0.base_261|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_497|, t2_funThread1of1ForFork0_#t~post5=|v_t2_funThread1of1ForFork0_#t~post5_114|, t2_funThread1of1ForFork0_#res.base=|v_t2_funThread1of1ForFork0_#res.base_51|} AuxVars[] AssignedVars[~g2~0, #pthreadsMutex, t2_funThread1of1ForFork0_#res.offset, t2_funThread1of1ForFork0_#t~nondet4, t2_funThread1of1ForFork0_#t~post5, t2_funThread1of1ForFork0_#res.base] and [333] L704-->ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse0 (select |v_#pthreadsMutex_1511| |v_~#mutex2~0.base_241|))) (let ((.cse2 (store |v_#pthreadsMutex_1511| |v_~#mutex2~0.base_241| (store .cse0 |v_~#mutex2~0.offset_241| 1)))) (let ((.cse1 (select .cse2 |v_~#__global_lock~0.base_485|))) (and (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_276| 0) (= (select .cse0 |v_~#mutex2~0.offset_241|) 0) (= (select .cse1 |v_~#__global_lock~0.offset_485|) 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_347| (ite (= v_~g2~0_613 0) 1 0)) (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_347| |v_ULTIMATE.start___VERIFIER_assert_~cond#1_276|) (= |v_#pthreadsMutex_1509| (store .cse2 |v_~#__global_lock~0.base_485| (store .cse1 |v_~#__global_lock~0.offset_485| 1))))))) InVars {~g2~0=v_~g2~0_613, #pthreadsMutex=|v_#pthreadsMutex_1511|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_485|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_241|, ~#mutex2~0.base=|v_~#mutex2~0.base_241|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_485|} OutVars{~g2~0=v_~g2~0_613, #pthreadsMutex=|v_#pthreadsMutex_1509|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_114|, ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_174|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_347|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_485|, ~#mutex2~0.offset=|v_~#mutex2~0.offset_241|, ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_276|, ~#mutex2~0.base=|v_~#mutex2~0.base_241|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_485|} 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] [2022-12-13 12:27:59,359 INFO L241 LiptonReduction]: Total number of compositions: 2 [2022-12-13 12:27:59,360 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 361 [2022-12-13 12:27:59,360 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 7 transitions, 60 flow [2022-12-13 12:27:59,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:27:59,360 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:27:59,360 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 12:27:59,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 12:27:59,360 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-13 12:27:59,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:27:59,360 INFO L85 PathProgramCache]: Analyzing trace with hash 325976901, now seen corresponding path program 1 times [2022-12-13 12:27:59,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:27:59,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78906800] [2022-12-13 12:27:59,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:27:59,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:27:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:27:59,417 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-13 12:27:59,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:27:59,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78906800] [2022-12-13 12:27:59,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78906800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:27:59,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:27:59,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:27:59,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075299285] [2022-12-13 12:27:59,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:27:59,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:27:59,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:27:59,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:27:59,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:27:59,419 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 7 [2022-12-13 12:27:59,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 7 transitions, 60 flow. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-13 12:27:59,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:27:59,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 7 [2022-12-13 12:27:59,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:27:59,428 INFO L130 PetriNetUnfolder]: 1/6 cut-off events. [2022-12-13 12:27:59,428 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-13 12:27:59,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 6 events. 1/6 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 3 event pairs, 0 based on Foata normal form. 1/7 useless extension candidates. Maximal degree in co-relation 20. Up to 5 conditions per place. [2022-12-13 12:27:59,428 INFO L137 encePairwiseOnDemand]: 2/7 looper letters, 0 selfloop transitions, 0 changer transitions 5/5 dead transitions. [2022-12-13 12:27:59,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 5 transitions, 40 flow [2022-12-13 12:27:59,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:27:59,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 12:27:59,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2022-12-13 12:27:59,429 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2857142857142857 [2022-12-13 12:27:59,429 INFO L175 Difference]: Start difference. First operand has 22 places, 7 transitions, 60 flow. Second operand 4 states and 8 transitions. [2022-12-13 12:27:59,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 5 transitions, 40 flow [2022-12-13 12:27:59,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 13 places, 5 transitions, 30 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-12-13 12:27:59,429 INFO L231 Difference]: Finished difference. Result has 13 places, 0 transitions, 0 flow [2022-12-13 12:27:59,429 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=7, PETRI_DIFFERENCE_MINUEND_FLOW=16, PETRI_DIFFERENCE_MINUEND_PLACES=10, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=13, PETRI_TRANSITIONS=0} [2022-12-13 12:27:59,429 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, -21 predicate places. [2022-12-13 12:27:59,429 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:27:59,430 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 13 places, 0 transitions, 0 flow [2022-12-13 12:27:59,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 12:27:59,430 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 12:27:59,430 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:27:59,430 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-13 12:27:59,430 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 12:27:59,430 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 12:27:59,430 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:27:59,431 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 12:27:59,431 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 12:27:59,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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-13 12:27:59,432 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 12:27:59,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-12-13 12:27:59,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-12-13 12:27:59,433 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 12:27:59,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 12:27:59,433 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:27:59,435 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:27:59,435 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:27:59,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:27:59 BasicIcfg [2022-12-13 12:27:59,436 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:27:59,437 INFO L158 Benchmark]: Toolchain (without parser) took 6434.87ms. Allocated memory was 204.5MB in the beginning and 329.3MB in the end (delta: 124.8MB). Free memory was 179.4MB in the beginning and 181.3MB in the end (delta: -1.9MB). Peak memory consumption was 123.4MB. Max. memory is 8.0GB. [2022-12-13 12:27:59,437 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 204.5MB. Free memory is still 181.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 12:27:59,437 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.36ms. Allocated memory is still 204.5MB. Free memory was 178.9MB in the beginning and 160.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2022-12-13 12:27:59,437 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.15ms. Allocated memory is still 204.5MB. Free memory was 159.5MB in the beginning and 157.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 12:27:59,437 INFO L158 Benchmark]: Boogie Preprocessor took 30.42ms. Allocated memory is still 204.5MB. Free memory was 157.4MB in the beginning and 156.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 12:27:59,438 INFO L158 Benchmark]: RCFGBuilder took 397.79ms. Allocated memory is still 204.5MB. Free memory was 156.3MB in the beginning and 141.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-13 12:27:59,438 INFO L158 Benchmark]: TraceAbstraction took 5627.06ms. Allocated memory was 204.5MB in the beginning and 329.3MB in the end (delta: 124.8MB). Free memory was 140.6MB in the beginning and 181.3MB in the end (delta: -40.7MB). Peak memory consumption was 84.6MB. Max. memory is 8.0GB. [2022-12-13 12:27:59,439 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.09ms. Allocated memory is still 204.5MB. Free memory is still 181.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 323.36ms. Allocated memory is still 204.5MB. Free memory was 178.9MB in the beginning and 160.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.15ms. Allocated memory is still 204.5MB. Free memory was 159.5MB in the beginning and 157.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.42ms. Allocated memory is still 204.5MB. Free memory was 157.4MB in the beginning and 156.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 397.79ms. Allocated memory is still 204.5MB. Free memory was 156.3MB in the beginning and 141.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 5627.06ms. Allocated memory was 204.5MB in the beginning and 329.3MB in the end (delta: 124.8MB). Free memory was 140.6MB in the beginning and 181.3MB in the end (delta: -40.7MB). Peak memory consumption was 84.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 88 PlacesBefore, 34 PlacesAfterwards, 86 TransitionsBefore, 31 TransitionsAfterwards, 1152 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 30 ConcurrentYvCompositions, 1 ChoiceCompositions, 70 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1763, independent: 1579, independent conditional: 1579, independent unconditional: 0, dependent: 184, dependent conditional: 184, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1763, independent: 1579, independent conditional: 0, independent unconditional: 1579, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1763, independent: 1579, independent conditional: 0, independent unconditional: 1579, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1763, independent: 1579, independent conditional: 0, independent unconditional: 1579, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 956, independent: 900, independent conditional: 0, independent unconditional: 900, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 956, independent: 848, independent conditional: 0, independent unconditional: 848, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 108, independent: 52, independent conditional: 0, independent unconditional: 52, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 181, independent: 84, independent conditional: 0, independent unconditional: 84, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1763, independent: 679, independent conditional: 0, independent unconditional: 679, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 956, unknown conditional: 0, unknown unconditional: 956] , Statistics on independence cache: Total cache size (in pairs): 1667, Positive cache size: 1611, Positive conditional cache size: 0, Positive unconditional cache size: 1611, Negative cache size: 56, Negative conditional cache size: 0, Negative unconditional cache size: 56, 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, 33 PlacesBefore, 33 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 441, independent: 344, independent conditional: 344, independent unconditional: 0, dependent: 97, dependent conditional: 97, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 441, independent: 344, independent conditional: 0, independent unconditional: 344, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 441, independent: 344, independent conditional: 0, independent unconditional: 344, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 441, independent: 344, independent conditional: 0, independent unconditional: 344, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 184, independent: 149, independent conditional: 0, independent unconditional: 149, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 184, independent: 107, independent conditional: 0, independent unconditional: 107, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 77, independent: 42, independent conditional: 0, independent unconditional: 42, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78, independent: 41, independent conditional: 0, independent unconditional: 41, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 441, independent: 195, independent conditional: 0, independent unconditional: 195, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 184, unknown conditional: 0, unknown unconditional: 184] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 149, Positive conditional cache size: 0, Positive unconditional cache size: 149, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, 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, 37 PlacesBefore, 37 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 332 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 131, independent: 87, independent conditional: 87, independent unconditional: 0, dependent: 44, dependent conditional: 44, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 131, independent: 87, independent conditional: 0, independent unconditional: 87, dependent: 44, dependent conditional: 7, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 131, independent: 87, independent conditional: 0, independent unconditional: 87, dependent: 44, dependent conditional: 7, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 131, independent: 87, independent conditional: 0, independent unconditional: 87, dependent: 44, dependent conditional: 7, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 34, independent: 23, independent conditional: 0, independent unconditional: 23, 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: 34, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 11, dependent conditional: 5, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 15, dependent conditional: 7, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 131, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 33, dependent conditional: 2, dependent unconditional: 31, unknown: 34, unknown conditional: 5, unknown unconditional: 29] , Statistics on independence cache: Total cache size (in pairs): 218, Positive cache size: 172, Positive conditional cache size: 0, Positive unconditional cache size: 172, Negative cache size: 46, Negative conditional cache size: 5, 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.0s, 37 PlacesBefore, 37 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 320 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 169, independent: 124, independent conditional: 124, independent unconditional: 0, dependent: 45, dependent conditional: 45, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 169, independent: 124, independent conditional: 26, independent unconditional: 98, dependent: 45, dependent conditional: 8, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 177, independent: 124, independent conditional: 0, independent unconditional: 124, dependent: 53, dependent conditional: 16, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 177, independent: 124, independent conditional: 0, independent unconditional: 124, dependent: 53, dependent conditional: 16, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 177, independent: 124, independent conditional: 0, independent unconditional: 124, dependent: 46, dependent conditional: 9, dependent unconditional: 37, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 172, Positive conditional cache size: 0, Positive unconditional cache size: 172, Negative cache size: 53, Negative conditional cache size: 12, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 43 PlacesBefore, 41 PlacesAfterwards, 30 TransitionsBefore, 29 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 365, independent: 280, independent conditional: 280, independent unconditional: 0, dependent: 85, dependent conditional: 85, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 365, independent: 280, independent conditional: 59, independent unconditional: 221, dependent: 85, dependent conditional: 43, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 369, independent: 280, independent conditional: 59, independent unconditional: 221, dependent: 89, dependent conditional: 21, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 369, independent: 280, independent conditional: 59, independent unconditional: 221, dependent: 89, dependent conditional: 21, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 61, independent: 47, independent conditional: 15, independent unconditional: 32, dependent: 14, dependent conditional: 9, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 61, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 42, independent: 28, independent conditional: 12, independent unconditional: 16, dependent: 14, dependent conditional: 9, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 67, independent: 49, independent conditional: 15, independent unconditional: 35, dependent: 17, dependent conditional: 11, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 369, independent: 233, independent conditional: 44, independent unconditional: 189, dependent: 75, dependent conditional: 12, dependent unconditional: 63, unknown: 61, unknown conditional: 24, unknown unconditional: 37] , Statistics on independence cache: Total cache size (in pairs): 315, Positive cache size: 248, Positive conditional cache size: 15, Positive unconditional cache size: 233, Negative cache size: 67, Negative conditional cache size: 21, Negative unconditional cache size: 46, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 36 PlacesBefore, 36 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 224 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 160, independent: 122, independent conditional: 122, independent unconditional: 0, dependent: 38, dependent conditional: 38, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 160, independent: 122, independent conditional: 36, independent unconditional: 86, dependent: 38, dependent conditional: 16, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 160, independent: 122, independent conditional: 36, independent unconditional: 86, dependent: 38, dependent conditional: 4, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 160, independent: 122, independent conditional: 36, independent unconditional: 86, dependent: 38, dependent conditional: 4, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 12, independent conditional: 8, independent unconditional: 4, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 6, dependent conditional: 2, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 160, independent: 110, independent conditional: 28, independent unconditional: 82, dependent: 32, dependent conditional: 2, dependent unconditional: 30, unknown: 18, unknown conditional: 10, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 333, Positive cache size: 260, Positive conditional cache size: 23, Positive unconditional cache size: 237, Negative cache size: 73, Negative conditional cache size: 23, Negative unconditional cache size: 50, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 12, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 30 PlacesBefore, 22 PlacesAfterwards, 24 TransitionsBefore, 15 TransitionsAfterwards, 64 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 27, independent conditional: 27, independent unconditional: 0, dependent: 13, dependent conditional: 13, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 40, independent: 27, independent conditional: 12, independent unconditional: 15, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 27, independent conditional: 12, independent unconditional: 15, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 27, independent conditional: 12, independent unconditional: 15, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, independent: 8, independent conditional: 7, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, independent: 19, independent conditional: 5, independent unconditional: 14, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 9, unknown conditional: 7, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 378, Positive cache size: 304, Positive conditional cache size: 30, Positive unconditional cache size: 274, Negative cache size: 74, Negative conditional cache size: 23, Negative unconditional cache size: 51, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 23 PlacesBefore, 24 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 20 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 24, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 24, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 24, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, independent: 11, independent conditional: 11, independent unconditional: 0, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 384, Positive cache size: 309, Positive conditional cache size: 35, Positive unconditional cache size: 274, Negative cache size: 75, Negative conditional cache size: 24, Negative unconditional cache size: 51, 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, 21 PlacesBefore, 19 PlacesAfterwards, 11 TransitionsBefore, 9 TransitionsAfterwards, 10 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 3, independent unconditional: 2, 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: 5, independent: 5, independent conditional: 3, independent unconditional: 2, 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: 5, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 7, independent: 7, independent conditional: 4, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 3, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 401, Positive cache size: 326, Positive conditional cache size: 38, Positive unconditional cache size: 288, Negative cache size: 75, Negative conditional cache size: 24, Negative unconditional cache size: 51, 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.4s, 24 PlacesBefore, 22 PlacesAfterwards, 9 TransitionsBefore, 7 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 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): 404, Positive cache size: 329, Positive conditional cache size: 38, Positive unconditional cache size: 291, Negative cache size: 75, Negative conditional cache size: 24, Negative unconditional cache size: 51, 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): 404, Positive cache size: 329, Positive conditional cache size: 38, Positive unconditional cache size: 291, Negative cache size: 75, Negative conditional cache size: 24, Negative unconditional cache size: 51, 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: 5.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 117 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 117 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 370 IncrementalHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 8 mSDtfsCounter, 370 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=4, InterpolantAutomatonStates: 38, 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.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 65 NumberOfCodeBlocks, 65 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 145 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-13 12:27:59,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...