/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/ldv-races/race-2_3-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 12:06:31,382 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:06:31,384 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:06:31,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:06:31,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:06:31,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:06:31,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:06:31,444 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:06:31,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:06:31,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:06:31,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:06:31,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:06:31,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:06:31,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:06:31,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:06:31,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:06:31,462 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:06:31,463 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:06:31,465 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:06:31,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:06:31,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:06:31,472 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:06:31,472 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:06:31,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:06:31,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:06:31,480 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:06:31,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:06:31,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:06:31,483 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:06:31,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:06:31,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:06:31,485 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:06:31,486 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:06:31,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:06:31,488 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:06:31,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:06:31,488 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:06:31,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:06:31,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:06:31,489 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:06:31,490 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:06:31,491 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:06:31,516 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:06:31,516 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:06:31,518 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:06:31,518 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:06:31,518 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:06:31,519 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:06:31,519 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:06:31,519 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:06:31,520 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:06:31,520 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:06:31,520 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 12:06:31,521 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:06:31,521 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 12:06:31,521 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:06:31,521 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 12:06:31,521 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:06:31,521 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 12:06:31,522 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:06:31,522 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:06:31,522 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 12:06:31,522 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:06:31,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:06:31,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:06:31,522 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:06:31,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:06:31,523 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 12:06:31,523 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:06:31,523 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 12:06:31,523 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:06:31,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:06:31,856 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:06:31,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:06:31,859 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:06:31,860 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:06:31,861 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_3-container_of.i [2022-12-13 12:06:33,070 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:06:33,414 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:06:33,415 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_3-container_of.i [2022-12-13 12:06:33,437 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02a9e2b57/6c898599498f4386bb00e6873913c0ce/FLAGc6be2f2b2 [2022-12-13 12:06:33,453 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02a9e2b57/6c898599498f4386bb00e6873913c0ce [2022-12-13 12:06:33,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:06:33,457 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 12:06:33,459 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:06:33,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:06:33,463 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:06:33,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:06:33" (1/1) ... [2022-12-13 12:06:33,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22969386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:33, skipping insertion in model container [2022-12-13 12:06:33,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:06:33" (1/1) ... [2022-12-13 12:06:33,471 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:06:33,524 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:06:33,640 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 12:06:34,250 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_3-container_of.i[75002,75015] [2022-12-13 12:06:34,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:34,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:34,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:34,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:34,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:34,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:34,283 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:34,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:34,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:34,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:34,285 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:34,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:34,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:34,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:34,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:06:34,316 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:06:34,327 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 12:06:34,368 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_3-container_of.i[75002,75015] [2022-12-13 12:06:34,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:34,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:34,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:34,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:34,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:34,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:34,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:34,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:34,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:34,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:34,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:34,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:34,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 12:06:34,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 12:06:34,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:06:34,522 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:06:34,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:34 WrapperNode [2022-12-13 12:06:34,524 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:06:34,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:06:34,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:06:34,526 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:06:34,532 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:06:34" (1/1) ... [2022-12-13 12:06:34,575 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:06:34" (1/1) ... [2022-12-13 12:06:34,610 INFO L138 Inliner]: procedures = 469, calls = 63, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 143 [2022-12-13 12:06:34,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:06:34,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:06:34,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:06:34,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:06:34,619 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:34" (1/1) ... [2022-12-13 12:06:34,620 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:34" (1/1) ... [2022-12-13 12:06:34,633 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:34" (1/1) ... [2022-12-13 12:06:34,633 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:34" (1/1) ... [2022-12-13 12:06:34,644 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:34" (1/1) ... [2022-12-13 12:06:34,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:34" (1/1) ... [2022-12-13 12:06:34,649 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:34" (1/1) ... [2022-12-13 12:06:34,650 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:34" (1/1) ... [2022-12-13 12:06:34,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:06:34,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:06:34,656 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:06:34,656 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:06:34,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:34" (1/1) ... [2022-12-13 12:06:34,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:06:34,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 12:06:34,700 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:06:34,723 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:06:34,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 12:06:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:06:34,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 12:06:34,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 12:06:34,740 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 12:06:34,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:06:34,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 12:06:34,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:06:34,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:06:34,783 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-12-13 12:06:34,784 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-12-13 12:06:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:06:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:06:34,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:06:34,786 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:06:35,144 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 12:06:35,146 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:06:35,331 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 12:06:35,369 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:06:35,369 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 12:06:35,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:06:35 BoogieIcfgContainer [2022-12-13 12:06:35,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:06:35,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:06:35,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:06:35,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:06:35,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:06:33" (1/3) ... [2022-12-13 12:06:35,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5188ecc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:06:35, skipping insertion in model container [2022-12-13 12:06:35,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:06:34" (2/3) ... [2022-12-13 12:06:35,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5188ecc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:06:35, skipping insertion in model container [2022-12-13 12:06:35,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:06:35" (3/3) ... [2022-12-13 12:06:35,379 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_3-container_of.i [2022-12-13 12:06:35,394 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:06:35,395 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-12-13 12:06:35,395 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 12:06:35,444 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 12:06:35,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 158 transitions, 332 flow [2022-12-13 12:06:35,562 INFO L130 PetriNetUnfolder]: 8/196 cut-off events. [2022-12-13 12:06:35,563 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 12:06:35,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 196 events. 8/196 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 340 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 103. Up to 4 conditions per place. [2022-12-13 12:06:35,568 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 158 transitions, 332 flow [2022-12-13 12:06:35,572 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 146 transitions, 304 flow [2022-12-13 12:06:35,574 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:06:35,590 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 146 transitions, 304 flow [2022-12-13 12:06:35,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 146 transitions, 304 flow [2022-12-13 12:06:35,630 INFO L130 PetriNetUnfolder]: 5/177 cut-off events. [2022-12-13 12:06:35,630 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 12:06:35,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 177 events. 5/177 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 288 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 93. Up to 4 conditions per place. [2022-12-13 12:06:35,639 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 146 transitions, 304 flow [2022-12-13 12:06:35,641 INFO L226 LiptonReduction]: Number of co-enabled transitions 2704 [2022-12-13 12:07:35,710 INFO L241 LiptonReduction]: Total number of compositions: 114 [2022-12-13 12:07:35,724 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:07:35,729 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;@590febed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 12:07:35,729 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-13 12:07:35,733 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-13 12:07:35,733 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:07:35,733 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:07:35,734 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 12:07:35,734 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:07:35,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:07:35,738 INFO L85 PathProgramCache]: Analyzing trace with hash 576236, now seen corresponding path program 1 times [2022-12-13 12:07:35,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:07:35,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898367636] [2022-12-13 12:07:35,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:07:35,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:07:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:07:36,108 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:07:36,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:07:36,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898367636] [2022-12-13 12:07:36,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898367636] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:07:36,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:07:36,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 12:07:36,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663773380] [2022-12-13 12:07:36,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:07:36,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 12:07:36,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:07:36,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 12:07:36,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 12:07:36,136 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52 [2022-12-13 12:07:36,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 116 flow. Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:07:36,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:07:36,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52 [2022-12-13 12:07:36,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:07:36,648 INFO L130 PetriNetUnfolder]: 2119/3699 cut-off events. [2022-12-13 12:07:36,648 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-13 12:07:36,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7120 conditions, 3699 events. 2119/3699 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 25591 event pairs, 2118 based on Foata normal form. 111/1927 useless extension candidates. Maximal degree in co-relation 6990. Up to 3383 conditions per place. [2022-12-13 12:07:36,676 INFO L137 encePairwiseOnDemand]: 51/52 looper letters, 41 selfloop transitions, 0 changer transitions 0/51 dead transitions. [2022-12-13 12:07:36,676 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 196 flow [2022-12-13 12:07:36,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 12:07:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 12:07:36,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-12-13 12:07:36,688 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5961538461538461 [2022-12-13 12:07:36,690 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 116 flow. Second operand 2 states and 62 transitions. [2022-12-13 12:07:36,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 51 transitions, 196 flow [2022-12-13 12:07:36,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 188 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 12:07:36,698 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 106 flow [2022-12-13 12:07:36,699 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2022-12-13 12:07:36,702 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -3 predicate places. [2022-12-13 12:07:36,703 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:07:36,704 INFO L89 Accepts]: Start accepts. Operand has 53 places, 51 transitions, 106 flow [2022-12-13 12:07:36,709 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:07:36,714 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:07:36,714 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 51 transitions, 106 flow [2022-12-13 12:07:36,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 51 transitions, 106 flow [2022-12-13 12:07:36,723 INFO L130 PetriNetUnfolder]: 1/57 cut-off events. [2022-12-13 12:07:36,724 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 12:07:36,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 57 events. 1/57 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 170 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 12:07:36,727 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 51 transitions, 106 flow [2022-12-13 12:07:36,727 INFO L226 LiptonReduction]: Number of co-enabled transitions 1092 [2022-12-13 12:07:58,901 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:58,902 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:07:58,905 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:07:58,906 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 12:08:08,032 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:08:08,034 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 31331 [2022-12-13 12:08:08,034 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 104 flow [2022-12-13 12:08:08,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:08,035 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:08:08,035 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 12:08:08,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:08:08,035 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:08:08,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:08:08,036 INFO L85 PathProgramCache]: Analyzing trace with hash 17857647, now seen corresponding path program 1 times [2022-12-13 12:08:08,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:08:08,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802717123] [2022-12-13 12:08:08,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:08:08,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:08:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:08:08,405 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:08:08,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:08:08,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802717123] [2022-12-13 12:08:08,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802717123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:08:08,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:08:08,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:08:08,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219234131] [2022-12-13 12:08:08,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:08:08,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:08:08,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:08:08,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:08:08,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:08:08,409 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 50 [2022-12-13 12:08:08,410 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:08,410 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:08:08,410 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 50 [2022-12-13 12:08:08,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:08:09,036 INFO L130 PetriNetUnfolder]: 3816/6267 cut-off events. [2022-12-13 12:08:09,036 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 12:08:09,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12371 conditions, 6267 events. 3816/6267 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 39412 event pairs, 2507 based on Foata normal form. 0/3608 useless extension candidates. Maximal degree in co-relation 623. Up to 4645 conditions per place. [2022-12-13 12:08:09,066 INFO L137 encePairwiseOnDemand]: 43/50 looper letters, 65 selfloop transitions, 6 changer transitions 0/75 dead transitions. [2022-12-13 12:08:09,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 75 transitions, 296 flow [2022-12-13 12:08:09,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:08:09,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:08:09,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-12-13 12:08:09,069 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.56 [2022-12-13 12:08:09,069 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 104 flow. Second operand 3 states and 84 transitions. [2022-12-13 12:08:09,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 75 transitions, 296 flow [2022-12-13 12:08:09,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 296 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 12:08:09,073 INFO L231 Difference]: Finished difference. Result has 54 places, 54 transitions, 140 flow [2022-12-13 12:08:09,073 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=54, PETRI_TRANSITIONS=54} [2022-12-13 12:08:09,074 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, -2 predicate places. [2022-12-13 12:08:09,074 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:08:09,074 INFO L89 Accepts]: Start accepts. Operand has 54 places, 54 transitions, 140 flow [2022-12-13 12:08:09,074 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:08:09,075 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:08:09,075 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 54 transitions, 140 flow [2022-12-13 12:08:09,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 54 places, 54 transitions, 140 flow [2022-12-13 12:08:09,091 INFO L130 PetriNetUnfolder]: 29/164 cut-off events. [2022-12-13 12:08:09,092 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-13 12:08:09,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 164 events. 29/164 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 848 event pairs, 16 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 81. Up to 53 conditions per place. [2022-12-13 12:08:09,094 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 54 transitions, 140 flow [2022-12-13 12:08:09,094 INFO L226 LiptonReduction]: Number of co-enabled transitions 1180 [2022-12-13 12:08:13,520 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:08:13,522 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4448 [2022-12-13 12:08:13,522 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 54 transitions, 140 flow [2022-12-13 12:08:13,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:13,522 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:08:13,522 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 12:08:13,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:08:13,522 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:08:13,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:08:13,523 INFO L85 PathProgramCache]: Analyzing trace with hash 553586206, now seen corresponding path program 1 times [2022-12-13 12:08:13,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:08:13,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127165341] [2022-12-13 12:08:13,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:08:13,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:08:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:08:13,735 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:08:13,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:08:13,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127165341] [2022-12-13 12:08:13,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127165341] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:08:13,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:08:13,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:08:13,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271896132] [2022-12-13 12:08:13,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:08:13,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:08:13,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:08:13,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:08:13,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:08:13,741 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 50 [2022-12-13 12:08:13,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 54 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:13,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:08:13,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 50 [2022-12-13 12:08:13,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:08:14,412 INFO L130 PetriNetUnfolder]: 3955/6525 cut-off events. [2022-12-13 12:08:14,412 INFO L131 PetriNetUnfolder]: For 810/810 co-relation queries the response was YES. [2022-12-13 12:08:14,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14200 conditions, 6525 events. 3955/6525 cut-off events. For 810/810 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 42042 event pairs, 2781 based on Foata normal form. 240/4269 useless extension candidates. Maximal degree in co-relation 6985. Up to 4966 conditions per place. [2022-12-13 12:08:14,446 INFO L137 encePairwiseOnDemand]: 44/50 looper letters, 67 selfloop transitions, 9 changer transitions 2/82 dead transitions. [2022-12-13 12:08:14,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 82 transitions, 374 flow [2022-12-13 12:08:14,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:08:14,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:08:14,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2022-12-13 12:08:14,449 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5533333333333333 [2022-12-13 12:08:14,450 INFO L175 Difference]: Start difference. First operand has 54 places, 54 transitions, 140 flow. Second operand 3 states and 83 transitions. [2022-12-13 12:08:14,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 82 transitions, 374 flow [2022-12-13 12:08:14,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 82 transitions, 364 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:08:14,467 INFO L231 Difference]: Finished difference. Result has 56 places, 60 transitions, 205 flow [2022-12-13 12:08:14,468 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=56, PETRI_TRANSITIONS=60} [2022-12-13 12:08:14,469 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 0 predicate places. [2022-12-13 12:08:14,469 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:08:14,492 INFO L89 Accepts]: Start accepts. Operand has 56 places, 60 transitions, 205 flow [2022-12-13 12:08:14,493 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:08:14,493 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:08:14,493 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 60 transitions, 205 flow [2022-12-13 12:08:14,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 60 transitions, 205 flow [2022-12-13 12:08:14,514 INFO L130 PetriNetUnfolder]: 72/248 cut-off events. [2022-12-13 12:08:14,514 INFO L131 PetriNetUnfolder]: For 96/98 co-relation queries the response was YES. [2022-12-13 12:08:14,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 248 events. 72/248 cut-off events. For 96/98 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1353 event pairs, 16 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 191. Up to 113 conditions per place. [2022-12-13 12:08:14,520 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 60 transitions, 205 flow [2022-12-13 12:08:14,521 INFO L226 LiptonReduction]: Number of co-enabled transitions 1304 [2022-12-13 12:08:14,538 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:08:14,539 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 70 [2022-12-13 12:08:14,539 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 60 transitions, 205 flow [2022-12-13 12:08:14,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:14,540 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:08:14,540 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:08:14,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:08:14,540 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:08:14,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:08:14,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1409752959, now seen corresponding path program 1 times [2022-12-13 12:08:14,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:08:14,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763144786] [2022-12-13 12:08:14,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:08:14,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:08:14,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:08:14,739 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:08:14,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:08:14,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763144786] [2022-12-13 12:08:14,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763144786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:08:14,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:08:14,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:08:14,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038057999] [2022-12-13 12:08:14,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:08:14,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:08:14,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:08:14,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:08:14,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:08:14,744 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 48 [2022-12-13 12:08:14,744 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 60 transitions, 205 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:14,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:08:14,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 48 [2022-12-13 12:08:14,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:08:15,480 INFO L130 PetriNetUnfolder]: 4875/8001 cut-off events. [2022-12-13 12:08:15,480 INFO L131 PetriNetUnfolder]: For 2694/2694 co-relation queries the response was YES. [2022-12-13 12:08:15,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18800 conditions, 8001 events. 4875/8001 cut-off events. For 2694/2694 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 52100 event pairs, 2506 based on Foata normal form. 0/5080 useless extension candidates. Maximal degree in co-relation 12275. Up to 5541 conditions per place. [2022-12-13 12:08:15,561 INFO L137 encePairwiseOnDemand]: 39/48 looper letters, 78 selfloop transitions, 8 changer transitions 0/90 dead transitions. [2022-12-13 12:08:15,561 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 90 transitions, 456 flow [2022-12-13 12:08:15,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:08:15,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:08:15,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-12-13 12:08:15,565 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6041666666666666 [2022-12-13 12:08:15,565 INFO L175 Difference]: Start difference. First operand has 56 places, 60 transitions, 205 flow. Second operand 3 states and 87 transitions. [2022-12-13 12:08:15,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 90 transitions, 456 flow [2022-12-13 12:08:15,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 90 transitions, 447 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 12:08:15,573 INFO L231 Difference]: Finished difference. Result has 59 places, 67 transitions, 276 flow [2022-12-13 12:08:15,573 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=59, PETRI_TRANSITIONS=67} [2022-12-13 12:08:15,575 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 3 predicate places. [2022-12-13 12:08:15,575 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:08:15,575 INFO L89 Accepts]: Start accepts. Operand has 59 places, 67 transitions, 276 flow [2022-12-13 12:08:15,576 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:08:15,576 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:08:15,576 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 67 transitions, 276 flow [2022-12-13 12:08:15,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 67 transitions, 276 flow [2022-12-13 12:08:15,609 INFO L130 PetriNetUnfolder]: 131/417 cut-off events. [2022-12-13 12:08:15,609 INFO L131 PetriNetUnfolder]: For 347/351 co-relation queries the response was YES. [2022-12-13 12:08:15,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1004 conditions, 417 events. 131/417 cut-off events. For 347/351 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2562 event pairs, 25 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 191. Up to 169 conditions per place. [2022-12-13 12:08:15,613 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 67 transitions, 276 flow [2022-12-13 12:08:15,613 INFO L226 LiptonReduction]: Number of co-enabled transitions 1510 [2022-12-13 12:08:20,158 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 12:08:20,159 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4584 [2022-12-13 12:08:20,159 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 67 transitions, 276 flow [2022-12-13 12:08:20,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:08:20,160 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:08:20,160 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:08:20,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:08:20,160 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:08:20,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:08:20,160 INFO L85 PathProgramCache]: Analyzing trace with hash 752669102, now seen corresponding path program 1 times [2022-12-13 12:08:20,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:08:20,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547561715] [2022-12-13 12:08:20,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:08:20,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:08:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:08:20,276 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:08:20,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:08:20,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547561715] [2022-12-13 12:08:20,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547561715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:08:20,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:08:20,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:08:20,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850491489] [2022-12-13 12:08:20,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:08:20,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:08:20,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:08:20,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:08:20,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:08:20,278 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 48 [2022-12-13 12:08:20,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 67 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:08:20,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 12:08:20,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 48 [2022-12-13 12:08:20,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 12:08:21,169 INFO L130 PetriNetUnfolder]: 5630/9177 cut-off events. [2022-12-13 12:08:21,170 INFO L131 PetriNetUnfolder]: For 7073/7073 co-relation queries the response was YES. [2022-12-13 12:08:21,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24135 conditions, 9177 events. 5630/9177 cut-off events. For 7073/7073 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 60706 event pairs, 3044 based on Foata normal form. 0/6094 useless extension candidates. Maximal degree in co-relation 2130. Up to 6430 conditions per place. [2022-12-13 12:08:21,213 INFO L137 encePairwiseOnDemand]: 39/48 looper letters, 82 selfloop transitions, 14 changer transitions 0/100 dead transitions. [2022-12-13 12:08:21,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 100 transitions, 603 flow [2022-12-13 12:08:21,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:08:21,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 12:08:21,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2022-12-13 12:08:21,216 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2022-12-13 12:08:21,216 INFO L175 Difference]: Start difference. First operand has 59 places, 67 transitions, 276 flow. Second operand 3 states and 86 transitions. [2022-12-13 12:08:21,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 100 transitions, 603 flow [2022-12-13 12:08:21,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 100 transitions, 545 flow, removed 16 selfloop flow, removed 2 redundant places. [2022-12-13 12:08:21,233 INFO L231 Difference]: Finished difference. Result has 61 places, 78 transitions, 384 flow [2022-12-13 12:08:21,233 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=48, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=61, PETRI_TRANSITIONS=78} [2022-12-13 12:08:21,235 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 5 predicate places. [2022-12-13 12:08:21,235 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 12:08:21,235 INFO L89 Accepts]: Start accepts. Operand has 61 places, 78 transitions, 384 flow [2022-12-13 12:08:21,236 INFO L95 Accepts]: Finished accepts. [2022-12-13 12:08:21,236 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 12:08:21,236 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 78 transitions, 384 flow [2022-12-13 12:08:21,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 78 transitions, 384 flow [2022-12-13 12:08:21,301 INFO L130 PetriNetUnfolder]: 238/626 cut-off events. [2022-12-13 12:08:21,301 INFO L131 PetriNetUnfolder]: For 961/968 co-relation queries the response was YES. [2022-12-13 12:08:21,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1798 conditions, 626 events. 238/626 cut-off events. For 961/968 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3988 event pairs, 23 based on Foata normal form. 0/532 useless extension candidates. Maximal degree in co-relation 316. Up to 263 conditions per place. [2022-12-13 12:08:21,307 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 78 transitions, 384 flow [2022-12-13 12:08:21,307 INFO L226 LiptonReduction]: Number of co-enabled transitions 1732 [2022-12-13 12:08:21,443 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 12:08:21,444 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 209 [2022-12-13 12:08:21,444 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 78 transitions, 388 flow [2022-12-13 12:08:21,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 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:08:21,444 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 12:08:21,444 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:08:21,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:08:21,445 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 12:08:21,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:08:21,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1831813374, now seen corresponding path program 1 times [2022-12-13 12:08:21,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:08:21,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468641879] [2022-12-13 12:08:21,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:08:21,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:08:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:08:21,494 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 12:08:21,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 12:08:21,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 12:08:21,555 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 12:08:21,556 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2022-12-13 12:08:21,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2022-12-13 12:08:21,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2022-12-13 12:08:21,558 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2022-12-13 12:08:21,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2022-12-13 12:08:21,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2022-12-13 12:08:21,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2022-12-13 12:08:21,559 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2022-12-13 12:08:21,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 12:08:21,559 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-12-13 12:08:21,564 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 12:08:21,565 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 12:08:21,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 12:08:21 BasicIcfg [2022-12-13 12:08:21,611 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 12:08:21,612 INFO L158 Benchmark]: Toolchain (without parser) took 108155.38ms. Allocated memory was 182.5MB in the beginning and 386.9MB in the end (delta: 204.5MB). Free memory was 155.5MB in the beginning and 123.5MB in the end (delta: 31.9MB). Peak memory consumption was 237.5MB. Max. memory is 8.0GB. [2022-12-13 12:08:21,612 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 182.5MB. Free memory is still 159.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 12:08:21,612 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1065.14ms. Allocated memory is still 182.5MB. Free memory was 155.5MB in the beginning and 98.8MB in the end (delta: 56.7MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. [2022-12-13 12:08:21,613 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.33ms. Allocated memory is still 182.5MB. Free memory was 98.8MB in the beginning and 95.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 12:08:21,613 INFO L158 Benchmark]: Boogie Preprocessor took 42.85ms. Allocated memory is still 182.5MB. Free memory was 95.7MB in the beginning and 92.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 12:08:21,613 INFO L158 Benchmark]: RCFGBuilder took 715.65ms. Allocated memory was 182.5MB in the beginning and 243.3MB in the end (delta: 60.8MB). Free memory was 92.6MB in the beginning and 195.8MB in the end (delta: -103.2MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. [2022-12-13 12:08:21,614 INFO L158 Benchmark]: TraceAbstraction took 106238.31ms. Allocated memory was 243.3MB in the beginning and 386.9MB in the end (delta: 143.7MB). Free memory was 194.7MB in the beginning and 123.5MB in the end (delta: 71.2MB). Peak memory consumption was 216.4MB. Max. memory is 8.0GB. [2022-12-13 12:08:21,615 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.11ms. Allocated memory is still 182.5MB. Free memory is still 159.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1065.14ms. Allocated memory is still 182.5MB. Free memory was 155.5MB in the beginning and 98.8MB in the end (delta: 56.7MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 85.33ms. Allocated memory is still 182.5MB. Free memory was 98.8MB in the beginning and 95.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.85ms. Allocated memory is still 182.5MB. Free memory was 95.7MB in the beginning and 92.6MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 715.65ms. Allocated memory was 182.5MB in the beginning and 243.3MB in the end (delta: 60.8MB). Free memory was 92.6MB in the beginning and 195.8MB in the end (delta: -103.2MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. * TraceAbstraction took 106238.31ms. Allocated memory was 243.3MB in the beginning and 386.9MB in the end (delta: 143.7MB). Free memory was 194.7MB in the beginning and 123.5MB in the end (delta: 71.2MB). Peak memory consumption was 216.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 60.1s, 148 PlacesBefore, 56 PlacesAfterwards, 146 TransitionsBefore, 52 TransitionsAfterwards, 2704 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 60 TrivialYvCompositions, 49 ConcurrentYvCompositions, 2 ChoiceCompositions, 114 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3028, independent: 2885, independent conditional: 2885, independent unconditional: 0, dependent: 78, dependent conditional: 78, dependent unconditional: 0, unknown: 65, unknown conditional: 65, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3028, independent: 2885, independent conditional: 0, independent unconditional: 2885, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 65, unknown conditional: 0, unknown unconditional: 65] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3028, independent: 2885, independent conditional: 0, independent unconditional: 2885, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 65, unknown conditional: 0, unknown unconditional: 65] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3028, independent: 2885, independent conditional: 0, independent unconditional: 2885, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 65, unknown conditional: 0, unknown unconditional: 65] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1856, independent: 1795, independent conditional: 0, independent unconditional: 1795, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 22, unknown conditional: 0, unknown unconditional: 22] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1856, independent: 1786, independent conditional: 0, independent unconditional: 1786, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 22, unknown conditional: 0, unknown unconditional: 22] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48593, independent: 118, independent conditional: 0, independent unconditional: 118, dependent: 951, dependent conditional: 0, dependent unconditional: 951, unknown: 47524, unknown conditional: 0, unknown unconditional: 47524] ], Cache Queries: [ total: 3028, independent: 1090, independent conditional: 0, independent unconditional: 1090, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 1899, unknown conditional: 0, unknown unconditional: 1899] , Statistics on independence cache: Total cache size (in pairs): 4068, Positive cache size: 4029, Positive conditional cache size: 0, Positive unconditional cache size: 4029, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Unknown cache size: 22, Unknown conditional cache size: 0, Unknown unconditional cache size: 22, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.3s, 52 PlacesBefore, 51 PlacesAfterwards, 51 TransitionsBefore, 50 TransitionsAfterwards, 1092 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 592, independent: 502, independent conditional: 502, independent unconditional: 0, dependent: 46, dependent conditional: 46, dependent unconditional: 0, unknown: 44, unknown conditional: 44, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 592, independent: 502, independent conditional: 0, independent unconditional: 502, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 44, unknown conditional: 0, unknown unconditional: 44] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 592, independent: 502, independent conditional: 0, independent unconditional: 502, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 44, unknown conditional: 0, unknown unconditional: 44] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 592, independent: 502, independent conditional: 0, independent unconditional: 502, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 44, unknown conditional: 0, unknown unconditional: 44] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 249, independent: 213, independent conditional: 0, independent unconditional: 213, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 249, independent: 205, independent conditional: 0, independent unconditional: 205, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 44, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , SemanticIndependenceRelation.Query Time [ms]: [ total: 31072, independent: 90, independent conditional: 0, independent unconditional: 90, dependent: 707, dependent conditional: 0, dependent unconditional: 707, unknown: 30275, unknown conditional: 0, unknown unconditional: 30275] ], Cache Queries: [ total: 592, independent: 289, independent conditional: 0, independent unconditional: 289, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 279, unknown conditional: 0, unknown unconditional: 279] , Statistics on independence cache: Total cache size (in pairs): 235, Positive cache size: 213, Positive conditional cache size: 0, Positive unconditional cache size: 213, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 14, Unknown conditional cache size: 0, Unknown unconditional cache size: 14, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 54 PlacesBefore, 54 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 1180 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 260, independent: 232, independent conditional: 232, independent unconditional: 0, dependent: 20, dependent conditional: 20, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 260, independent: 232, independent conditional: 8, independent unconditional: 224, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 8, unknown conditional: 4, unknown unconditional: 4] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 260, independent: 232, independent conditional: 8, independent unconditional: 224, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 8, unknown conditional: 4, unknown unconditional: 4] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 260, independent: 232, independent conditional: 8, independent unconditional: 224, dependent: 20, dependent conditional: 3, dependent unconditional: 17, unknown: 8, unknown conditional: 4, unknown unconditional: 4] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 3, dependent unconditional: 1, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4423, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 107, dependent conditional: 106, dependent unconditional: 2, unknown: 4315, unknown conditional: 4315, unknown unconditional: 0] ], Cache Queries: [ total: 260, independent: 231, independent conditional: 8, independent unconditional: 223, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 13, unknown conditional: 7, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 240, Positive cache size: 214, Positive conditional cache size: 0, Positive unconditional cache size: 214, Negative cache size: 26, Negative conditional cache size: 3, Negative unconditional cache size: 23, Unknown cache size: 16, Unknown conditional cache size: 2, Unknown unconditional cache size: 14, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 56 PlacesBefore, 56 PlacesAfterwards, 60 TransitionsBefore, 60 TransitionsAfterwards, 1304 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 426, independent: 385, independent conditional: 385, independent unconditional: 0, dependent: 36, dependent conditional: 36, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 426, independent: 385, independent conditional: 8, independent unconditional: 377, dependent: 36, dependent conditional: 2, dependent unconditional: 34, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 426, independent: 385, independent conditional: 8, independent unconditional: 377, dependent: 36, dependent conditional: 2, dependent unconditional: 34, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 426, independent: 385, independent conditional: 8, independent unconditional: 377, dependent: 36, dependent conditional: 2, dependent unconditional: 34, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, independent: 23, independent conditional: 0, independent unconditional: 23, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 2, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 11, dependent conditional: 6, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 426, independent: 362, independent conditional: 8, independent unconditional: 354, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 32, unknown conditional: 2, unknown unconditional: 30] , Statistics on independence cache: Total cache size (in pairs): 267, Positive cache size: 237, Positive conditional cache size: 0, Positive unconditional cache size: 237, Negative cache size: 30, Negative conditional cache size: 5, Negative unconditional cache size: 25, Unknown cache size: 16, Unknown conditional cache size: 2, Unknown unconditional cache size: 14, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 59 PlacesBefore, 59 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 1510 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 332, independent: 297, independent conditional: 297, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 332, independent: 297, independent conditional: 20, independent unconditional: 277, dependent: 31, dependent conditional: 10, dependent unconditional: 21, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 332, independent: 297, independent conditional: 20, independent unconditional: 277, dependent: 31, dependent conditional: 10, dependent unconditional: 21, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 332, independent: 297, independent conditional: 20, independent unconditional: 277, dependent: 31, dependent conditional: 10, dependent unconditional: 21, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 21, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 21, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4540, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 167, dependent conditional: 163, dependent unconditional: 4, unknown: 4372, unknown conditional: 4372, unknown unconditional: 0] ], Cache Queries: [ total: 332, independent: 284, independent conditional: 20, independent unconditional: 264, dependent: 25, dependent conditional: 6, dependent unconditional: 19, unknown: 23, unknown conditional: 8, unknown unconditional: 15] , Statistics on independence cache: Total cache size (in pairs): 286, Positive cache size: 250, Positive conditional cache size: 0, Positive unconditional cache size: 250, Negative cache size: 36, Negative conditional cache size: 9, Negative unconditional cache size: 27, Unknown cache size: 18, Unknown conditional cache size: 4, Unknown unconditional cache size: 14, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 61 PlacesBefore, 61 PlacesAfterwards, 78 TransitionsBefore, 78 TransitionsAfterwards, 1732 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 831, independent: 752, independent conditional: 752, independent unconditional: 0, dependent: 79, dependent conditional: 79, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 831, independent: 752, independent conditional: 154, independent unconditional: 598, dependent: 79, dependent conditional: 48, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 831, independent: 752, independent conditional: 154, independent unconditional: 598, dependent: 79, dependent conditional: 48, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 831, independent: 752, independent conditional: 154, independent unconditional: 598, dependent: 79, dependent conditional: 48, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, independent: 11, independent conditional: 1, independent unconditional: 10, dependent: 7, dependent conditional: 6, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 18, independent: 11, independent conditional: 0, independent unconditional: 11, 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: 6, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 19, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 19, dependent conditional: 17, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 831, independent: 741, independent conditional: 153, independent unconditional: 588, dependent: 72, dependent conditional: 42, dependent unconditional: 30, unknown: 18, unknown conditional: 7, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 319, Positive cache size: 276, Positive conditional cache size: 1, Positive unconditional cache size: 275, Negative cache size: 43, Negative conditional cache size: 15, Negative unconditional cache size: 28, Unknown cache size: 18, Unknown conditional cache size: 4, Unknown unconditional cache size: 14, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; [L1745] CALL, EXPR 0 my_drv_init() [L1739] 0 return 0; [L1745] RET, EXPR 0 my_drv_init() [L1745] 0 int ret = my_drv_init(); [L1746] COND TRUE 0 ret==0 [L1747] 0 int probe_ret; [L1748] 0 struct my_data data; [L1749] CALL 0 my_drv_probe(&data) [L1706] 0 struct device *d = &data->dev; [L1708] 0 data->shared.a = 0 [L1709] 0 data->shared.b = 0 [L1710] 0 int res = __VERIFIER_nondet_int(); [L1711] COND FALSE 0 !(\read(res)) [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={5:24}, d={5:24}, data={5:0}, data={5:0}, pthread_create(&t1, ((void *)0), my_callback, (void *)d)=-2, res=0, t1={3:0}, t2={4:0}] [L1689] 1 struct device *dev = (struct device*)arg; [L1690] 1 struct my_data *data; [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, pthread_create(&t2, ((void *)0), my_callback, (void *)d)=-1, pthread_mutex_lock (&data->lock)=0, res=0, t1={3:0}, t2={4:0}] [L1716] 0 data->shared.a = 3 VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, pthread_mutex_lock (&data->lock)=0, res=0, t1={3:0}, t2={4:0}] [L1694] 1 data->shared.a = 1 VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={3:0}, t2={4:0}] [L1719] 0 data->shared.b = 3 VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, res=0, t1={3:0}, t2={4:0}] [L1722] EXPR 0 data->shared.a [L1722] CALL 0 ldv_assert(data->shared.a==3) [L1675] COND TRUE 0 !expression [L1675] 0 reach_error() VAL [\old(expression)=0, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, t1={3:0}, t2={4:0}] - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1713]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1714]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 168 locations, 8 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: 106.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 60.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 478 IncrementalHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 20 mSDtfsCounter, 478 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=388occurred in iteration=5, InterpolantAutomatonStates: 14, 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.9s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 RESULT: Ultimate proved your program to be incorrect! [2022-12-13 12:08:21,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...