/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_4-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 04:36:43,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 04:36:43,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 04:36:43,559 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 04:36:43,559 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 04:36:43,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 04:36:43,567 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 04:36:43,572 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 04:36:43,576 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 04:36:43,580 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 04:36:43,581 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 04:36:43,583 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 04:36:43,583 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 04:36:43,585 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 04:36:43,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 04:36:43,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 04:36:43,588 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 04:36:43,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 04:36:43,594 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 04:36:43,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 04:36:43,602 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 04:36:43,603 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 04:36:43,604 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 04:36:43,605 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 04:36:43,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 04:36:43,612 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 04:36:43,612 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 04:36:43,614 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 04:36:43,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 04:36:43,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 04:36:43,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 04:36:43,617 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 04:36:43,618 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 04:36:43,619 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 04:36:43,620 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 04:36:43,620 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 04:36:43,621 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 04:36:43,621 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 04:36:43,621 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 04:36:43,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 04:36:43,623 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 04:36:43,623 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 04:36:43,656 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 04:36:43,657 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 04:36:43,659 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 04:36:43,659 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 04:36:43,659 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 04:36:43,660 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 04:36:43,660 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 04:36:43,660 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 04:36:43,660 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 04:36:43,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 04:36:43,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 04:36:43,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 04:36:43,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 04:36:43,661 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 04:36:43,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 04:36:43,662 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 04:36:43,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 04:36:43,662 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 04:36:43,662 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 04:36:43,662 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 04:36:43,663 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 04:36:43,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:36:43,663 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 04:36:43,663 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 04:36:43,663 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 04:36:43,663 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 04:36:43,664 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 04:36:43,664 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 04:36:43,664 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 04:36:43,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 04:36:43,995 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 04:36:43,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 04:36:43,998 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 04:36:44,000 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 04:36:44,001 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_4-container_of.i [2022-12-06 04:36:45,153 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 04:36:45,515 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 04:36:45,515 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_4-container_of.i [2022-12-06 04:36:45,541 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2766db9d6/6f449d4946414bf8b5c044eccdb49c72/FLAG3e370d6b8 [2022-12-06 04:36:45,560 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2766db9d6/6f449d4946414bf8b5c044eccdb49c72 [2022-12-06 04:36:45,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 04:36:45,564 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 04:36:45,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 04:36:45,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 04:36:45,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 04:36:45,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:36:45" (1/1) ... [2022-12-06 04:36:45,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@136c04a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:45, skipping insertion in model container [2022-12-06 04:36:45,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 04:36:45" (1/1) ... [2022-12-06 04:36:45,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 04:36:45,634 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 04:36:45,813 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-06 04:36:46,390 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_4-container_of.i[75002,75015] [2022-12-06 04:36:46,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:46,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:46,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:46,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:46,405 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:46,406 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:46,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:46,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:46,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:46,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:46,438 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:46,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:46,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:46,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:46,459 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:36:46,471 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 04:36:46,484 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-06 04:36:46,524 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_4-container_of.i[75002,75015] [2022-12-06 04:36:46,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:46,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:46,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:46,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:46,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:46,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:46,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:46,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:46,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:46,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:46,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:46,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:46,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 04:36:46,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 04:36:46,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 04:36:46,676 INFO L208 MainTranslator]: Completed translation [2022-12-06 04:36:46,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:46 WrapperNode [2022-12-06 04:36:46,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 04:36:46,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 04:36:46,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 04:36:46,680 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 04:36:46,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:46" (1/1) ... [2022-12-06 04:36:46,742 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:46" (1/1) ... [2022-12-06 04:36:46,783 INFO L138 Inliner]: procedures = 469, calls = 63, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 143 [2022-12-06 04:36:46,784 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 04:36:46,785 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 04:36:46,785 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 04:36:46,785 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 04:36:46,794 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:46" (1/1) ... [2022-12-06 04:36:46,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:46" (1/1) ... [2022-12-06 04:36:46,810 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:46" (1/1) ... [2022-12-06 04:36:46,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:46" (1/1) ... [2022-12-06 04:36:46,838 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:46" (1/1) ... [2022-12-06 04:36:46,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:46" (1/1) ... [2022-12-06 04:36:46,857 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:46" (1/1) ... [2022-12-06 04:36:46,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:46" (1/1) ... [2022-12-06 04:36:46,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 04:36:46,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 04:36:46,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 04:36:46,866 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 04:36:46,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:46" (1/1) ... [2022-12-06 04:36:46,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 04:36:46,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 04:36:46,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 04:36:46,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 04:36:46,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 04:36:46,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 04:36:46,947 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 04:36:46,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 04:36:46,947 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 04:36:46,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 04:36:46,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-06 04:36:46,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 04:36:46,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 04:36:46,947 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-12-06 04:36:46,948 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-12-06 04:36:46,948 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 04:36:46,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 04:36:46,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 04:36:46,950 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 04:36:47,277 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 04:36:47,278 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 04:36:47,484 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 04:36:47,539 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 04:36:47,540 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 04:36:47,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:36:47 BoogieIcfgContainer [2022-12-06 04:36:47,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 04:36:47,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 04:36:47,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 04:36:47,547 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 04:36:47,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 04:36:45" (1/3) ... [2022-12-06 04:36:47,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b2aecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:36:47, skipping insertion in model container [2022-12-06 04:36:47,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 04:36:46" (2/3) ... [2022-12-06 04:36:47,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44b2aecc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 04:36:47, skipping insertion in model container [2022-12-06 04:36:47,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 04:36:47" (3/3) ... [2022-12-06 04:36:47,550 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_4-container_of.i [2022-12-06 04:36:47,567 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 04:36:47,567 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-12-06 04:36:47,568 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 04:36:47,667 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 04:36:47,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 158 transitions, 332 flow [2022-12-06 04:36:47,795 INFO L130 PetriNetUnfolder]: 8/202 cut-off events. [2022-12-06 04:36:47,795 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 04:36:47,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 202 events. 8/202 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 393 event pairs, 0 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 109. Up to 4 conditions per place. [2022-12-06 04:36:47,801 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 158 transitions, 332 flow [2022-12-06 04:36:47,806 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 146 transitions, 304 flow [2022-12-06 04:36:47,807 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:36:47,822 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 146 transitions, 304 flow [2022-12-06 04:36:47,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 146 transitions, 304 flow [2022-12-06 04:36:47,875 INFO L130 PetriNetUnfolder]: 5/183 cut-off events. [2022-12-06 04:36:47,875 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 04:36:47,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 183 events. 5/183 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 344 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 99. Up to 4 conditions per place. [2022-12-06 04:36:47,880 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 146 transitions, 304 flow [2022-12-06 04:36:47,880 INFO L188 LiptonReduction]: Number of co-enabled transitions 2704 [2022-12-06 04:36:52,634 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:36:52,635 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:36:52,638 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:36:52,638 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:36:53,108 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:36:53,109 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:36:53,112 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:36:53,113 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:36:53,151 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:36:53,152 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:36:53,154 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:36:53,155 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:36:55,649 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:36:55,650 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:36:55,653 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:36:55,654 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:36:58,184 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:36:58,185 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:36:58,187 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:36:58,188 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:00,476 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:00,477 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:00,479 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:00,480 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:02,999 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:03,000 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:03,002 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:03,003 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:03,229 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:03,230 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:03,233 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:03,234 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:05,610 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:05,611 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:05,613 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:05,614 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:15,393 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:15,394 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2022-12-06 04:37:15,396 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:15,397 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:15,399 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:15,399 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2022-12-06 04:37:15,401 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:15,402 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:16,305 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:16,306 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:16,307 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:16,308 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:16,456 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:16,457 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:16,458 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:16,459 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:16,738 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:16,739 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:16,741 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:16,742 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:18,068 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:18,069 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:18,071 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:18,071 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:18,359 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:18,360 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 04:37:18,372 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:18,373 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:18,379 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:18,379 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 04:37:18,383 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:18,385 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:18,403 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:18,404 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:18,410 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:18,411 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:18,417 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:18,418 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 04:37:18,424 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:18,425 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:18,434 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:18,435 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 04:37:18,438 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:18,439 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:24,340 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:24,341 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:24,345 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:24,346 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:24,350 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:24,351 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 04:37:24,355 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:24,356 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:24,360 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:24,362 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 04:37:24,367 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:24,368 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:24,376 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:24,377 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 04:37:24,381 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:24,381 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:24,384 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:24,385 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2022-12-06 04:37:24,388 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:24,389 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:48,585 INFO L203 LiptonReduction]: Total number of compositions: 112 [2022-12-06 04:37:48,601 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 04:37:48,607 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;@45c5abe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 04:37:48,607 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-06 04:37:48,615 INFO L130 PetriNetUnfolder]: 0/10 cut-off events. [2022-12-06 04:37:48,616 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:37:48,616 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:37:48,616 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-06 04:37:48,617 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 04:37:48,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:37:48,621 INFO L85 PathProgramCache]: Analyzing trace with hash 571168, now seen corresponding path program 1 times [2022-12-06 04:37:48,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:37:48,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26468998] [2022-12-06 04:37:48,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:37:48,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:37:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:37:48,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:37:48,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:37:48,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26468998] [2022-12-06 04:37:48,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26468998] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:37:48,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:37:48,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 04:37:48,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240822746] [2022-12-06 04:37:48,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:37:48,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-06 04:37:48,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:37:48,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-06 04:37:48,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-06 04:37:48,979 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 39 [2022-12-06 04:37:48,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 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-06 04:37:48,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:37:48,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 39 [2022-12-06 04:37:48,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:37:49,246 INFO L130 PetriNetUnfolder]: 529/1029 cut-off events. [2022-12-06 04:37:49,247 INFO L131 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2022-12-06 04:37:49,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1949 conditions, 1029 events. 529/1029 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6168 event pairs, 528 based on Foata normal form. 31/798 useless extension candidates. Maximal degree in co-relation 1859. Up to 897 conditions per place. [2022-12-06 04:37:49,259 INFO L137 encePairwiseOnDemand]: 38/39 looper letters, 31 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2022-12-06 04:37:49,259 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 150 flow [2022-12-06 04:37:49,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-06 04:37:49,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-06 04:37:49,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2022-12-06 04:37:49,271 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2022-12-06 04:37:49,272 INFO L175 Difference]: Start difference. First operand has 43 places, 39 transitions, 90 flow. Second operand 2 states and 46 transitions. [2022-12-06 04:37:49,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 150 flow [2022-12-06 04:37:49,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 142 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 04:37:49,279 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 80 flow [2022-12-06 04:37:49,281 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=80, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2022-12-06 04:37:49,285 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2022-12-06 04:37:49,286 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:37:49,286 INFO L89 Accepts]: Start accepts. Operand has 40 places, 38 transitions, 80 flow [2022-12-06 04:37:49,290 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:37:49,290 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:37:49,290 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 38 transitions, 80 flow [2022-12-06 04:37:49,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 38 transitions, 80 flow [2022-12-06 04:37:49,302 INFO L130 PetriNetUnfolder]: 1/50 cut-off events. [2022-12-06 04:37:49,302 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 04:37:49,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 50 events. 1/50 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 141 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:37:49,304 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 38 transitions, 80 flow [2022-12-06 04:37:49,304 INFO L188 LiptonReduction]: Number of co-enabled transitions 444 [2022-12-06 04:37:51,611 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:51,613 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:37:51,618 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:37:51,619 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:38:00,841 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:38:00,843 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11558 [2022-12-06 04:38:00,843 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 78 flow [2022-12-06 04:38:00,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 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-06 04:38:00,844 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:38:00,844 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-06 04:38:00,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 04:38:00,844 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 04:38:00,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:38:00,845 INFO L85 PathProgramCache]: Analyzing trace with hash 17731531, now seen corresponding path program 1 times [2022-12-06 04:38:00,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:38:00,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162626389] [2022-12-06 04:38:00,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:38:00,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:38:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:38:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:38:01,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:38:01,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162626389] [2022-12-06 04:38:01,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162626389] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:38:01,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:38:01,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:38:01,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244642958] [2022-12-06 04:38:01,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:38:01,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:38:01,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:38:01,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:38:01,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:38:01,128 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 37 [2022-12-06 04:38:01,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:38:01,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:38:01,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 37 [2022-12-06 04:38:01,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:38:01,293 INFO L130 PetriNetUnfolder]: 528/1010 cut-off events. [2022-12-06 04:38:01,293 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 04:38:01,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1912 conditions, 1010 events. 528/1010 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5734 event pairs, 332 based on Foata normal form. 0/745 useless extension candidates. Maximal degree in co-relation 210. Up to 573 conditions per place. [2022-12-06 04:38:01,300 INFO L137 encePairwiseOnDemand]: 34/37 looper letters, 41 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2022-12-06 04:38:01,300 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 50 transitions, 190 flow [2022-12-06 04:38:01,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:38:01,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:38:01,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-12-06 04:38:01,302 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5855855855855856 [2022-12-06 04:38:01,302 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 78 flow. Second operand 3 states and 65 transitions. [2022-12-06 04:38:01,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 50 transitions, 190 flow [2022-12-06 04:38:01,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 190 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 04:38:01,304 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 92 flow [2022-12-06 04:38:01,304 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2022-12-06 04:38:01,305 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2022-12-06 04:38:01,305 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:38:01,305 INFO L89 Accepts]: Start accepts. Operand has 42 places, 38 transitions, 92 flow [2022-12-06 04:38:01,305 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:38:01,306 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:38:01,306 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 38 transitions, 92 flow [2022-12-06 04:38:01,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 38 transitions, 92 flow [2022-12-06 04:38:01,312 INFO L130 PetriNetUnfolder]: 0/46 cut-off events. [2022-12-06 04:38:01,312 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 04:38:01,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 46 events. 0/46 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 92 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 04:38:01,313 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 38 transitions, 92 flow [2022-12-06 04:38:01,313 INFO L188 LiptonReduction]: Number of co-enabled transitions 444 [2022-12-06 04:38:16,366 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:38:16,367 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15062 [2022-12-06 04:38:16,367 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 92 flow [2022-12-06 04:38:16,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:38:16,368 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:38:16,368 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-06 04:38:16,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 04:38:16,368 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 04:38:16,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:38:16,368 INFO L85 PathProgramCache]: Analyzing trace with hash 17700968, now seen corresponding path program 1 times [2022-12-06 04:38:16,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:38:16,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177034264] [2022-12-06 04:38:16,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:38:16,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:38:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:38:16,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:38:16,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:38:16,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177034264] [2022-12-06 04:38:16,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177034264] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:38:16,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:38:16,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:38:16,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746669998] [2022-12-06 04:38:16,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:38:16,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:38:16,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:38:16,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:38:16,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:38:16,718 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 04:38:16,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 92 flow. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:38:16,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:38:16,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 04:38:16,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:38:17,062 INFO L130 PetriNetUnfolder]: 1364/2249 cut-off events. [2022-12-06 04:38:17,062 INFO L131 PetriNetUnfolder]: For 160/160 co-relation queries the response was YES. [2022-12-06 04:38:17,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4660 conditions, 2249 events. 1364/2249 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 11529 event pairs, 918 based on Foata normal form. 0/1882 useless extension candidates. Maximal degree in co-relation 2501. Up to 1822 conditions per place. [2022-12-06 04:38:17,074 INFO L137 encePairwiseOnDemand]: 30/37 looper letters, 46 selfloop transitions, 7 changer transitions 0/53 dead transitions. [2022-12-06 04:38:17,074 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 53 transitions, 228 flow [2022-12-06 04:38:17,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:38:17,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:38:17,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2022-12-06 04:38:17,078 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4774774774774775 [2022-12-06 04:38:17,078 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 92 flow. Second operand 3 states and 53 transitions. [2022-12-06 04:38:17,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 53 transitions, 228 flow [2022-12-06 04:38:17,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 226 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:38:17,081 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 129 flow [2022-12-06 04:38:17,081 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2022-12-06 04:38:17,083 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2022-12-06 04:38:17,083 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:38:17,083 INFO L89 Accepts]: Start accepts. Operand has 44 places, 42 transitions, 129 flow [2022-12-06 04:38:17,083 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:38:17,083 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:38:17,083 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 42 transitions, 129 flow [2022-12-06 04:38:17,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 42 transitions, 129 flow [2022-12-06 04:38:17,098 INFO L130 PetriNetUnfolder]: 28/141 cut-off events. [2022-12-06 04:38:17,099 INFO L131 PetriNetUnfolder]: For 29/35 co-relation queries the response was YES. [2022-12-06 04:38:17,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 141 events. 28/141 cut-off events. For 29/35 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 652 event pairs, 16 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 66. Up to 53 conditions per place. [2022-12-06 04:38:17,100 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 42 transitions, 129 flow [2022-12-06 04:38:17,100 INFO L188 LiptonReduction]: Number of co-enabled transitions 476 [2022-12-06 04:38:21,578 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:38:21,579 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4496 [2022-12-06 04:38:21,579 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 129 flow [2022-12-06 04:38:21,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:38:21,579 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:38:21,580 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-06 04:38:21,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 04:38:21,580 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 04:38:21,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:38:21,580 INFO L85 PathProgramCache]: Analyzing trace with hash 548729619, now seen corresponding path program 1 times [2022-12-06 04:38:21,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:38:21,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507190990] [2022-12-06 04:38:21,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:38:21,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:38:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:38:21,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:38:21,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:38:21,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507190990] [2022-12-06 04:38:21,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507190990] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:38:21,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:38:21,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:38:21,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801404311] [2022-12-06 04:38:21,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:38:21,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:38:21,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:38:21,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:38:21,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:38:21,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-06 04:38:21,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 129 flow. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:38:21,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:38:21,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-06 04:38:21,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:38:22,158 INFO L130 PetriNetUnfolder]: 1438/2392 cut-off events. [2022-12-06 04:38:22,158 INFO L131 PetriNetUnfolder]: For 635/635 co-relation queries the response was YES. [2022-12-06 04:38:22,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5684 conditions, 2392 events. 1438/2392 cut-off events. For 635/635 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 12652 event pairs, 994 based on Foata normal form. 91/2147 useless extension candidates. Maximal degree in co-relation 2759. Up to 1927 conditions per place. [2022-12-06 04:38:22,174 INFO L137 encePairwiseOnDemand]: 31/37 looper letters, 48 selfloop transitions, 9 changer transitions 3/60 dead transitions. [2022-12-06 04:38:22,175 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 307 flow [2022-12-06 04:38:22,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:38:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:38:22,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 04:38:22,177 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46846846846846846 [2022-12-06 04:38:22,177 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 129 flow. Second operand 3 states and 52 transitions. [2022-12-06 04:38:22,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 307 flow [2022-12-06 04:38:22,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 296 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 04:38:22,184 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 184 flow [2022-12-06 04:38:22,185 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2022-12-06 04:38:22,186 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2022-12-06 04:38:22,186 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:38:22,186 INFO L89 Accepts]: Start accepts. Operand has 46 places, 47 transitions, 184 flow [2022-12-06 04:38:22,187 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:38:22,187 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:38:22,187 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 47 transitions, 184 flow [2022-12-06 04:38:22,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 47 transitions, 184 flow [2022-12-06 04:38:22,208 INFO L130 PetriNetUnfolder]: 72/215 cut-off events. [2022-12-06 04:38:22,208 INFO L131 PetriNetUnfolder]: For 104/112 co-relation queries the response was YES. [2022-12-06 04:38:22,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515 conditions, 215 events. 72/215 cut-off events. For 104/112 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1099 event pairs, 16 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 188. Up to 113 conditions per place. [2022-12-06 04:38:22,211 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 47 transitions, 184 flow [2022-12-06 04:38:22,211 INFO L188 LiptonReduction]: Number of co-enabled transitions 508 [2022-12-06 04:38:22,224 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:38:22,225 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:38:22,228 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:38:22,229 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:38:22,231 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:38:22,232 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:38:22,233 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 04:38:22,234 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-06 04:38:24,743 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [555] L1714-4-->L1756-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_105|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_638|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_102|, #memory_int=|v_#memory_int_709|, ULTIMATE.start_my_drv_probe_#t~pre12#1=|v_ULTIMATE.start_my_drv_probe_#t~pre12#1_35|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_638|, ULTIMATE.start_my_drv_probe_#t~nondet13#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet13#1_25|, ULTIMATE.start_main_#t~ret21#1=|v_ULTIMATE.start_main_#t~ret21#1_90|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#res#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_my_drv_probe_#t~pre12#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~nondet13#1, ULTIMATE.start_main_#t~ret21#1] and [404] L1698-->L1700: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_11 28))) (and (= |v_#memory_$Pointer$.offset_23| (store |v_#memory_$Pointer$.offset_24| v_my_callbackThread1of1ForFork1_~data~0.base_11 (store (select |v_#memory_$Pointer$.offset_24| v_my_callbackThread1of1ForFork1_~data~0.base_11) .cse0 (select (select |v_#memory_$Pointer$.offset_23| v_my_callbackThread1of1ForFork1_~data~0.base_11) .cse0)))) (= (store |v_#memory_$Pointer$.base_24| v_my_callbackThread1of1ForFork1_~data~0.base_11 (store (select |v_#memory_$Pointer$.base_24| v_my_callbackThread1of1ForFork1_~data~0.base_11) .cse0 (select (select |v_#memory_$Pointer$.base_23| v_my_callbackThread1of1ForFork1_~data~0.base_11) .cse0))) |v_#memory_$Pointer$.base_23|) (= |v_#memory_int_36| (store |v_#memory_int_37| v_my_callbackThread1of1ForFork1_~data~0.base_11 (store (select |v_#memory_int_37| v_my_callbackThread1of1ForFork1_~data~0.base_11) .cse0 (+ v_my_callbackThread1of1ForFork1_~lb~0_3 1)))))) InVars {my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_11, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_11, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_24|, my_callbackThread1of1ForFork1_~lb~0=v_my_callbackThread1of1ForFork1_~lb~0_3, #memory_int=|v_#memory_int_37|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_24|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_11, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_11, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_23|, my_callbackThread1of1ForFork1_~lb~0=v_my_callbackThread1of1ForFork1_~lb~0_3, #memory_int=|v_#memory_int_36|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_23|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-06 04:38:24,747 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [555] L1714-4-->L1756-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_105|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_638|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_102|, #memory_int=|v_#memory_int_709|, ULTIMATE.start_my_drv_probe_#t~pre12#1=|v_ULTIMATE.start_my_drv_probe_#t~pre12#1_35|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_638|, ULTIMATE.start_my_drv_probe_#t~nondet13#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet13#1_25|, ULTIMATE.start_main_#t~ret21#1=|v_ULTIMATE.start_main_#t~ret21#1_90|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#res#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_my_drv_probe_#t~pre12#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~nondet13#1, ULTIMATE.start_main_#t~ret21#1] and [391] L1698-->L1700: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_11 28))) (and (= |v_#memory_int_36| (store |v_#memory_int_37| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_int_37| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (+ v_my_callbackThread1of1ForFork0_~lb~0_3 1)))) (= |v_#memory_$Pointer$.offset_23| (store |v_#memory_$Pointer$.offset_24| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_$Pointer$.offset_24| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (select (select |v_#memory_$Pointer$.offset_23| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0)))) (= (store |v_#memory_$Pointer$.base_24| v_my_callbackThread1of1ForFork0_~data~0.base_11 (store (select |v_#memory_$Pointer$.base_24| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0 (select (select |v_#memory_$Pointer$.base_23| v_my_callbackThread1of1ForFork0_~data~0.base_11) .cse0))) |v_#memory_$Pointer$.base_23|))) InVars {my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_11, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_24|, my_callbackThread1of1ForFork0_~lb~0=v_my_callbackThread1of1ForFork0_~lb~0_3, #memory_int=|v_#memory_int_37|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_11, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_24|} OutVars{my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_11, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_23|, my_callbackThread1of1ForFork0_~lb~0=v_my_callbackThread1of1ForFork0_~lb~0_3, #memory_int=|v_#memory_int_36|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_11, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_23|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-06 04:38:24,751 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [555] L1714-4-->L1756-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_105|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_638|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_102|, #memory_int=|v_#memory_int_709|, ULTIMATE.start_my_drv_probe_#t~pre12#1=|v_ULTIMATE.start_my_drv_probe_#t~pre12#1_35|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_638|, ULTIMATE.start_my_drv_probe_#t~nondet13#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet13#1_25|, ULTIMATE.start_main_#t~ret21#1=|v_ULTIMATE.start_main_#t~ret21#1_90|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#res#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_my_drv_probe_#t~pre12#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~nondet13#1, ULTIMATE.start_main_#t~ret21#1] and [427] L1692-1-->L1694: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork1_~data~0.offset_33 24))) (and (= (store |v_#memory_$Pointer$.base_50| v_my_callbackThread1of1ForFork1_~data~0.base_33 (store (select |v_#memory_$Pointer$.base_50| v_my_callbackThread1of1ForFork1_~data~0.base_33) .cse0 (select (select |v_#memory_$Pointer$.base_49| v_my_callbackThread1of1ForFork1_~data~0.base_33) .cse0))) |v_#memory_$Pointer$.base_49|) (= (store |v_#memory_$Pointer$.offset_50| v_my_callbackThread1of1ForFork1_~data~0.base_33 (store (select |v_#memory_$Pointer$.offset_50| v_my_callbackThread1of1ForFork1_~data~0.base_33) .cse0 (select (select |v_#memory_$Pointer$.offset_49| v_my_callbackThread1of1ForFork1_~data~0.base_33) .cse0))) |v_#memory_$Pointer$.offset_49|) (= |v_#memory_int_86| (store |v_#memory_int_87| v_my_callbackThread1of1ForFork1_~data~0.base_33 (store (select |v_#memory_int_87| v_my_callbackThread1of1ForFork1_~data~0.base_33) .cse0 1))))) InVars {my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_33, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_33, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_50|, #memory_int=|v_#memory_int_87|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_50|} OutVars{my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_33, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_33, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_49|, my_callbackThread1of1ForFork1_#t~nondet7=|v_my_callbackThread1of1ForFork1_#t~nondet7_9|, #memory_int=|v_#memory_int_86|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_49|} AuxVars[] AssignedVars[#memory_$Pointer$.base, my_callbackThread1of1ForFork1_#t~nondet7, #memory_int, #memory_$Pointer$.offset] [2022-12-06 04:38:24,755 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [555] L1714-4-->L1756-1: Formula: false InVars {} OutVars{ULTIMATE.start_my_drv_probe_#res#1=|v_ULTIMATE.start_my_drv_probe_#res#1_105|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_638|, ULTIMATE.start_main_~probe_ret~0#1=|v_ULTIMATE.start_main_~probe_ret~0#1_102|, #memory_int=|v_#memory_int_709|, ULTIMATE.start_my_drv_probe_#t~pre12#1=|v_ULTIMATE.start_my_drv_probe_#t~pre12#1_35|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_638|, ULTIMATE.start_my_drv_probe_#t~nondet13#1=|v_ULTIMATE.start_my_drv_probe_#t~nondet13#1_25|, ULTIMATE.start_main_#t~ret21#1=|v_ULTIMATE.start_main_#t~ret21#1_90|} AuxVars[] AssignedVars[ULTIMATE.start_my_drv_probe_#res#1, #memory_$Pointer$.base, ULTIMATE.start_main_~probe_ret~0#1, #memory_int, ULTIMATE.start_my_drv_probe_#t~pre12#1, #memory_$Pointer$.offset, ULTIMATE.start_my_drv_probe_#t~nondet13#1, ULTIMATE.start_main_#t~ret21#1] and [389] L1693-->L1694: Formula: (let ((.cse0 (+ v_my_callbackThread1of1ForFork0_~data~0.offset_7 24))) (and (= |v_#memory_int_33| (store |v_#memory_int_34| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_int_34| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 1))) (= (store |v_#memory_$Pointer$.offset_22| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.offset_22| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.offset_21| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.offset_21|) (= (store |v_#memory_$Pointer$.base_22| v_my_callbackThread1of1ForFork0_~data~0.base_7 (store (select |v_#memory_$Pointer$.base_22| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0 (select (select |v_#memory_$Pointer$.base_21| v_my_callbackThread1of1ForFork0_~data~0.base_7) .cse0))) |v_#memory_$Pointer$.base_21|))) InVars {#memory_int=|v_#memory_int_34|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_22|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_22|} OutVars{#memory_int=|v_#memory_int_33|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_7, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_21|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_7, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_21|} AuxVars[] AssignedVars[#memory_$Pointer$.base, #memory_int, #memory_$Pointer$.offset] [2022-12-06 04:38:29,218 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 04:38:29,220 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7034 [2022-12-06 04:38:29,220 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 46 transitions, 202 flow [2022-12-06 04:38:29,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:38:29,220 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:38:29,220 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:38:29,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 04:38:29,220 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 04:38:29,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:38:29,221 INFO L85 PathProgramCache]: Analyzing trace with hash -2143876269, now seen corresponding path program 1 times [2022-12-06 04:38:29,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:38:29,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770914631] [2022-12-06 04:38:29,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:38:29,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:38:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:38:29,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:38:29,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:38:29,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770914631] [2022-12-06 04:38:29,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770914631] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:38:29,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:38:29,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:38:29,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105936087] [2022-12-06 04:38:29,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:38:29,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:38:29,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:38:29,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:38:29,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:38:29,408 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 38 [2022-12-06 04:38:29,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 46 transitions, 202 flow. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:38:29,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:38:29,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 38 [2022-12-06 04:38:29,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:38:29,647 INFO L130 PetriNetUnfolder]: 1005/1674 cut-off events. [2022-12-06 04:38:29,647 INFO L131 PetriNetUnfolder]: For 1176/1176 co-relation queries the response was YES. [2022-12-06 04:38:29,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4135 conditions, 1674 events. 1005/1674 cut-off events. For 1176/1176 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8473 event pairs, 308 based on Foata normal form. 77/1461 useless extension candidates. Maximal degree in co-relation 4129. Up to 994 conditions per place. [2022-12-06 04:38:29,658 INFO L137 encePairwiseOnDemand]: 25/38 looper letters, 41 selfloop transitions, 7 changer transitions 0/48 dead transitions. [2022-12-06 04:38:29,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 48 transitions, 231 flow [2022-12-06 04:38:29,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:38:29,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:38:29,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-12-06 04:38:29,662 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2022-12-06 04:38:29,662 INFO L175 Difference]: Start difference. First operand has 45 places, 46 transitions, 202 flow. Second operand 3 states and 54 transitions. [2022-12-06 04:38:29,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 48 transitions, 231 flow [2022-12-06 04:38:29,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 48 transitions, 213 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-06 04:38:29,665 INFO L231 Difference]: Finished difference. Result has 38 places, 35 transitions, 132 flow [2022-12-06 04:38:29,666 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=38, PETRI_TRANSITIONS=35} [2022-12-06 04:38:29,667 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -5 predicate places. [2022-12-06 04:38:29,668 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:38:29,668 INFO L89 Accepts]: Start accepts. Operand has 38 places, 35 transitions, 132 flow [2022-12-06 04:38:29,668 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:38:29,668 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:38:29,668 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 35 transitions, 132 flow [2022-12-06 04:38:29,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 35 transitions, 132 flow [2022-12-06 04:38:29,685 INFO L130 PetriNetUnfolder]: 55/186 cut-off events. [2022-12-06 04:38:29,685 INFO L131 PetriNetUnfolder]: For 79/82 co-relation queries the response was YES. [2022-12-06 04:38:29,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 186 events. 55/186 cut-off events. For 79/82 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 921 event pairs, 21 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 84. Up to 83 conditions per place. [2022-12-06 04:38:29,687 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 35 transitions, 132 flow [2022-12-06 04:38:29,687 INFO L188 LiptonReduction]: Number of co-enabled transitions 356 [2022-12-06 04:38:34,176 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 04:38:34,177 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4509 [2022-12-06 04:38:34,177 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 132 flow [2022-12-06 04:38:34,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:38:34,177 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:38:34,177 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:38:34,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 04:38:34,178 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 04:38:34,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:38:34,178 INFO L85 PathProgramCache]: Analyzing trace with hash -2035654534, now seen corresponding path program 1 times [2022-12-06 04:38:34,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:38:34,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699482704] [2022-12-06 04:38:34,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:38:34,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:38:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 04:38:34,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 04:38:34,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 04:38:34,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699482704] [2022-12-06 04:38:34,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699482704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 04:38:34,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 04:38:34,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 04:38:34,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015619765] [2022-12-06 04:38:34,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 04:38:34,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 04:38:34,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 04:38:34,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 04:38:34,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 04:38:34,376 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 04:38:34,376 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 132 flow. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:38:34,376 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 04:38:34,376 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 04:38:34,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 04:38:34,644 INFO L130 PetriNetUnfolder]: 1290/2157 cut-off events. [2022-12-06 04:38:34,644 INFO L131 PetriNetUnfolder]: For 1638/1638 co-relation queries the response was YES. [2022-12-06 04:38:34,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5864 conditions, 2157 events. 1290/2157 cut-off events. For 1638/1638 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 11470 event pairs, 472 based on Foata normal form. 0/1881 useless extension candidates. Maximal degree in co-relation 420. Up to 1300 conditions per place. [2022-12-06 04:38:34,658 INFO L137 encePairwiseOnDemand]: 21/29 looper letters, 45 selfloop transitions, 12 changer transitions 0/57 dead transitions. [2022-12-06 04:38:34,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 57 transitions, 339 flow [2022-12-06 04:38:34,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 04:38:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 04:38:34,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-06 04:38:34,659 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2022-12-06 04:38:34,659 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 132 flow. Second operand 3 states and 48 transitions. [2022-12-06 04:38:34,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 57 transitions, 339 flow [2022-12-06 04:38:34,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 57 transitions, 283 flow, removed 16 selfloop flow, removed 3 redundant places. [2022-12-06 04:38:34,666 INFO L231 Difference]: Finished difference. Result has 38 places, 45 transitions, 210 flow [2022-12-06 04:38:34,666 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=210, PETRI_PLACES=38, PETRI_TRANSITIONS=45} [2022-12-06 04:38:34,668 INFO L294 CegarLoopForPetriNet]: 43 programPoint places, -5 predicate places. [2022-12-06 04:38:34,668 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 04:38:34,668 INFO L89 Accepts]: Start accepts. Operand has 38 places, 45 transitions, 210 flow [2022-12-06 04:38:34,669 INFO L95 Accepts]: Finished accepts. [2022-12-06 04:38:34,669 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 04:38:34,669 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 45 transitions, 210 flow [2022-12-06 04:38:34,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 45 transitions, 210 flow [2022-12-06 04:38:34,710 INFO L130 PetriNetUnfolder]: 154/369 cut-off events. [2022-12-06 04:38:34,710 INFO L131 PetriNetUnfolder]: For 251/254 co-relation queries the response was YES. [2022-12-06 04:38:34,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 950 conditions, 369 events. 154/369 cut-off events. For 251/254 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1939 event pairs, 19 based on Foata normal form. 0/349 useless extension candidates. Maximal degree in co-relation 173. Up to 198 conditions per place. [2022-12-06 04:38:34,713 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 45 transitions, 210 flow [2022-12-06 04:38:34,713 INFO L188 LiptonReduction]: Number of co-enabled transitions 400 [2022-12-06 04:38:34,825 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 04:38:34,826 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-06 04:38:34,826 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 45 transitions, 214 flow [2022-12-06 04:38:34,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 04:38:34,826 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 04:38:34,827 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:38:34,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 04:38:34,827 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-06 04:38:34,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 04:38:34,827 INFO L85 PathProgramCache]: Analyzing trace with hash 360243302, now seen corresponding path program 1 times [2022-12-06 04:38:34,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 04:38:34,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457228872] [2022-12-06 04:38:34,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 04:38:34,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 04:38:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:38:34,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 04:38:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 04:38:34,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 04:38:34,939 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 04:38:34,940 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2022-12-06 04:38:34,941 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2022-12-06 04:38:34,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2022-12-06 04:38:34,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2022-12-06 04:38:34,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2022-12-06 04:38:34,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2022-12-06 04:38:34,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2022-12-06 04:38:34,942 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2022-12-06 04:38:34,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 04:38:34,943 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-12-06 04:38:34,948 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 04:38:34,948 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 04:38:34,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 04:38:34 BasicIcfg [2022-12-06 04:38:34,987 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 04:38:34,987 INFO L158 Benchmark]: Toolchain (without parser) took 109423.48ms. Allocated memory was 192.9MB in the beginning and 242.2MB in the end (delta: 49.3MB). Free memory was 165.8MB in the beginning and 163.9MB in the end (delta: 1.9MB). Peak memory consumption was 52.5MB. Max. memory is 8.0GB. [2022-12-06 04:38:34,987 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory is still 169.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:38:34,988 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1112.36ms. Allocated memory is still 192.9MB. Free memory was 165.8MB in the beginning and 109.0MB in the end (delta: 56.9MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. [2022-12-06 04:38:34,988 INFO L158 Benchmark]: Boogie Procedure Inliner took 104.54ms. Allocated memory is still 192.9MB. Free memory was 109.0MB in the beginning and 105.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:38:34,988 INFO L158 Benchmark]: Boogie Preprocessor took 80.39ms. Allocated memory is still 192.9MB. Free memory was 105.8MB in the beginning and 103.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 04:38:34,988 INFO L158 Benchmark]: RCFGBuilder took 676.49ms. Allocated memory is still 192.9MB. Free memory was 102.7MB in the beginning and 75.9MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-06 04:38:34,988 INFO L158 Benchmark]: TraceAbstraction took 107442.45ms. Allocated memory was 192.9MB in the beginning and 242.2MB in the end (delta: 49.3MB). Free memory was 74.9MB in the beginning and 163.9MB in the end (delta: -89.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 04:38:34,990 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory is still 169.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1112.36ms. Allocated memory is still 192.9MB. Free memory was 165.8MB in the beginning and 109.0MB in the end (delta: 56.9MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 104.54ms. Allocated memory is still 192.9MB. Free memory was 109.0MB in the beginning and 105.8MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 80.39ms. Allocated memory is still 192.9MB. Free memory was 105.8MB in the beginning and 103.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 676.49ms. Allocated memory is still 192.9MB. Free memory was 102.7MB in the beginning and 75.9MB in the end (delta: 26.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 107442.45ms. Allocated memory was 192.9MB in the beginning and 242.2MB in the end (delta: 49.3MB). Free memory was 74.9MB in the beginning and 163.9MB in the end (delta: -89.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 60.7s, 148 PlacesBefore, 43 PlacesAfterwards, 146 TransitionsBefore, 39 TransitionsAfterwards, 2704 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 60 TrivialYvCompositions, 48 ConcurrentYvCompositions, 2 ChoiceCompositions, 112 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1928, independent: 1800, independent conditional: 1800, independent unconditional: 0, dependent: 76, dependent conditional: 76, dependent unconditional: 0, unknown: 52, unknown conditional: 52, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1928, independent: 1800, independent conditional: 0, independent unconditional: 1800, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 52, unknown conditional: 0, unknown unconditional: 52] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1928, independent: 1800, independent conditional: 0, independent unconditional: 1800, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 52, unknown conditional: 0, unknown unconditional: 52] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1928, independent: 1800, independent conditional: 0, independent unconditional: 1800, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 52, unknown conditional: 0, unknown unconditional: 52] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1505, independent: 1449, independent conditional: 0, independent unconditional: 1449, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 22, unknown conditional: 0, unknown unconditional: 22] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1505, independent: 1444, independent conditional: 0, independent unconditional: 1444, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 61, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 22, unknown conditional: 0, unknown unconditional: 22] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48726, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 1003, dependent conditional: 0, dependent unconditional: 1003, unknown: 47708, unknown conditional: 0, unknown unconditional: 47708] ], Cache Queries: [ total: 1928, independent: 351, independent conditional: 0, independent unconditional: 351, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 1535, unknown conditional: 0, unknown unconditional: 1535] , Statistics on independence cache: Total cache size (in pairs): 2676, Positive cache size: 2642, Positive conditional cache size: 0, Positive unconditional cache size: 2642, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, 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: 11.5s, 39 PlacesBefore, 38 PlacesAfterwards, 38 TransitionsBefore, 37 TransitionsAfterwards, 444 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 348, independent: 270, independent conditional: 270, independent unconditional: 0, dependent: 68, dependent conditional: 68, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 348, independent: 270, independent conditional: 0, independent unconditional: 270, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 348, independent: 270, independent conditional: 0, independent unconditional: 270, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 348, independent: 270, independent conditional: 0, independent unconditional: 270, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 143, independent: 112, independent conditional: 0, independent unconditional: 112, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 143, independent: 108, independent conditional: 0, independent unconditional: 108, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 35, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11338, independent: 85, independent conditional: 0, independent unconditional: 85, dependent: 336, dependent conditional: 0, dependent unconditional: 336, unknown: 10917, unknown conditional: 0, unknown unconditional: 10917] ], Cache Queries: [ total: 348, independent: 158, independent conditional: 0, independent unconditional: 158, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 148, unknown conditional: 0, unknown unconditional: 148] , Statistics on independence cache: Total cache size (in pairs): 138, Positive cache size: 112, Positive conditional cache size: 0, Positive unconditional cache size: 112, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 5, Unknown conditional cache size: 0, Unknown unconditional cache size: 5, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.1s, 42 PlacesBefore, 42 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 444 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 99, independent: 59, independent conditional: 59, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 99, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 99, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15050, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 76, dependent conditional: 0, dependent unconditional: 76, unknown: 14974, unknown conditional: 0, unknown unconditional: 14974] ], Cache Queries: [ total: 99, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 114, Positive conditional cache size: 0, Positive unconditional cache size: 114, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 12, Unknown conditional cache size: 0, Unknown unconditional cache size: 12, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 44 PlacesBefore, 44 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 476 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 192, independent: 157, independent conditional: 157, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 192, independent: 157, independent conditional: 8, independent unconditional: 149, dependent: 29, dependent conditional: 3, dependent unconditional: 26, unknown: 6, unknown conditional: 5, unknown unconditional: 1] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 192, independent: 157, independent conditional: 8, independent unconditional: 149, dependent: 29, dependent conditional: 3, dependent unconditional: 26, unknown: 6, unknown conditional: 5, unknown unconditional: 1] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 192, independent: 157, independent conditional: 8, independent unconditional: 149, dependent: 29, dependent conditional: 3, dependent unconditional: 26, unknown: 6, unknown conditional: 5, unknown unconditional: 1] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4474, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 78, dependent conditional: 78, dependent unconditional: 0, unknown: 4395, unknown conditional: 4395, unknown unconditional: 0] ], Cache Queries: [ total: 192, independent: 139, independent conditional: 8, independent unconditional: 131, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 27, unknown conditional: 8, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 132, Positive conditional cache size: 0, Positive unconditional cache size: 132, Negative cache size: 32, Negative conditional cache size: 3, Negative unconditional cache size: 29, Unknown cache size: 14, Unknown conditional cache size: 2, Unknown unconditional cache size: 12, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.0s, 46 PlacesBefore, 45 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 508 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 398, independent: 320, independent conditional: 320, independent unconditional: 0, dependent: 70, dependent conditional: 70, dependent unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 398, independent: 320, independent conditional: 24, independent unconditional: 296, dependent: 70, dependent conditional: 4, dependent unconditional: 66, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 402, independent: 320, independent conditional: 24, independent unconditional: 296, dependent: 74, dependent conditional: 8, dependent unconditional: 66, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 402, independent: 320, independent conditional: 24, independent unconditional: 296, dependent: 74, dependent conditional: 8, dependent unconditional: 66, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 37, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6736, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 178, dependent conditional: 9, dependent unconditional: 169, unknown: 6557, unknown conditional: 0, unknown unconditional: 6557] ], Cache Queries: [ total: 402, independent: 298, independent conditional: 24, independent unconditional: 274, dependent: 62, dependent conditional: 4, dependent unconditional: 58, unknown: 42, unknown conditional: 4, unknown unconditional: 38] , Statistics on independence cache: Total cache size (in pairs): 214, Positive cache size: 170, Positive conditional cache size: 0, Positive unconditional cache size: 170, Negative cache size: 44, Negative conditional cache size: 7, Negative unconditional cache size: 37, Unknown cache size: 17, Unknown conditional cache size: 2, Unknown unconditional cache size: 15, Eliminated conditions: 0, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.5s, 37 PlacesBefore, 37 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 356 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, independent: 77, independent conditional: 77, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 93, independent: 77, independent conditional: 8, independent unconditional: 69, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 93, independent: 77, independent conditional: 8, independent unconditional: 69, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 93, independent: 77, independent conditional: 8, independent unconditional: 69, dependent: 12, dependent conditional: 4, dependent unconditional: 8, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4486, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 87, dependent conditional: 87, dependent unconditional: 0, unknown: 4400, unknown conditional: 4400, unknown unconditional: 0] ], Cache Queries: [ total: 93, independent: 75, independent conditional: 8, independent unconditional: 67, dependent: 9, dependent conditional: 1, dependent unconditional: 8, unknown: 9, unknown conditional: 7, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 219, Positive cache size: 172, Positive conditional cache size: 0, Positive unconditional cache size: 172, Negative cache size: 47, Negative conditional cache size: 10, Negative unconditional cache size: 37, Unknown cache size: 19, Unknown conditional cache size: 4, Unknown unconditional cache size: 15, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 38 PlacesBefore, 38 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 400 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 234, independent: 183, independent conditional: 183, independent unconditional: 0, dependent: 51, dependent conditional: 51, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 234, independent: 183, independent conditional: 26, independent unconditional: 157, dependent: 51, dependent conditional: 28, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 234, independent: 183, independent conditional: 26, independent unconditional: 157, dependent: 51, dependent conditional: 28, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 234, independent: 183, independent conditional: 26, independent unconditional: 157, dependent: 51, dependent conditional: 28, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 5, dependent conditional: 4, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 14, dependent conditional: 11, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 234, independent: 176, independent conditional: 25, independent unconditional: 151, dependent: 46, dependent conditional: 24, dependent unconditional: 22, unknown: 12, unknown conditional: 5, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 239, Positive cache size: 187, Positive conditional cache size: 1, Positive unconditional cache size: 186, Negative cache size: 52, Negative conditional cache size: 14, Negative unconditional cache size: 38, Unknown cache size: 19, Unknown conditional cache size: 4, Unknown unconditional cache size: 15, 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, EXPR 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)=8, 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)=9, pthread_mutex_lock (&data->lock)=0, res=0, t1={3:0}, t2={4:0}] [L1715] 0 return 0; [L1749] RET, EXPR 0 my_drv_probe(&data) [L1749] 0 probe_ret = my_drv_probe(&data) [L1750] COND TRUE 0 probe_ret==0 [L1751] CALL 0 my_drv_disconnect(&data) [L1721] 0 void *status; [L1723] 0 data->shared.a = 3 VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, pthread_mutex_lock (&data->lock)=0, status={7: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}] [L1726] 0 data->shared.b = 3 VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, status={7:0}, t1={3:0}, t2={4:0}] [L1729] EXPR 0 data->shared.a [L1729] 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: 107.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 60.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 22 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 397 IncrementalHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 22 mSDtfsCounter, 397 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=6, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 40 NumberOfCodeBlocks, 40 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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-06 04:38:35,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...