/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_3-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 03:19:20,769 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 03:19:20,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 03:19:20,795 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 03:19:20,796 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 03:19:20,799 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 03:19:20,801 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 03:19:20,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 03:19:20,808 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 03:19:20,812 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 03:19:20,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 03:19:20,813 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 03:19:20,814 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 03:19:20,814 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 03:19:20,815 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 03:19:20,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 03:19:20,816 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 03:19:20,816 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 03:19:20,817 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 03:19:20,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 03:19:20,819 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 03:19:20,826 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 03:19:20,827 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 03:19:20,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 03:19:20,830 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 03:19:20,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 03:19:20,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 03:19:20,831 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 03:19:20,831 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 03:19:20,831 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 03:19:20,832 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 03:19:20,832 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 03:19:20,833 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 03:19:20,833 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 03:19:20,834 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 03:19:20,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 03:19:20,834 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 03:19:20,835 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 03:19:20,835 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 03:19:20,835 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 03:19:20,836 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 03:19:20,836 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 03:19:20,858 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 03:19:20,858 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 03:19:20,859 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 03:19:20,859 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 03:19:20,859 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 03:19:20,859 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 03:19:20,859 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 03:19:20,860 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 03:19:20,860 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 03:19:20,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 03:19:20,860 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 03:19:20,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 03:19:20,860 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 03:19:20,860 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 03:19:20,860 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 03:19:20,861 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 03:19:20,861 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 03:19:20,861 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 03:19:20,861 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 03:19:20,861 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 03:19:20,861 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 03:19:20,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:19:20,862 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 03:19:20,862 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 03:19:20,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 03:19:20,862 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 03:19:20,862 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 03:19:20,862 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 03:19:20,862 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 03:19:21,116 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 03:19:21,137 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 03:19:21,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 03:19:21,140 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 03:19:21,140 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 03:19:21,141 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_3-container_of.i [2022-12-13 03:19:22,145 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 03:19:22,443 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 03:19:22,445 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_3-container_of.i [2022-12-13 03:19:22,465 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55c2f0301/052fa4cefb5a4b29ba1ca5003630273c/FLAGfe11f8fe5 [2022-12-13 03:19:22,483 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55c2f0301/052fa4cefb5a4b29ba1ca5003630273c [2022-12-13 03:19:22,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 03:19:22,486 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 03:19:22,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 03:19:22,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 03:19:22,491 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 03:19:22,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:19:22" (1/1) ... [2022-12-13 03:19:22,492 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74ef6db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:22, skipping insertion in model container [2022-12-13 03:19:22,492 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:19:22" (1/1) ... [2022-12-13 03:19:22,497 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 03:19:22,551 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 03:19:22,654 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 03:19:23,052 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_3-container_of.i[75002,75015] [2022-12-13 03:19:23,060 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:19:23,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:19:23,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:19:23,061 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:19:23,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:19:23,062 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:19:23,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:19:23,084 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:19:23,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:19:23,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:19:23,085 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:19:23,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:19:23,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:19:23,086 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:19:23,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:19:23,111 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 03:19:23,120 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 03:19:23,140 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_3-container_of.i[75002,75015] [2022-12-13 03:19:23,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:19:23,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:19:23,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:19:23,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:19:23,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:19:23,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:19:23,147 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:19:23,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:19:23,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:19:23,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:19:23,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:19:23,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:19:23,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 03:19:23,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 03:19:23,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 03:19:23,251 INFO L208 MainTranslator]: Completed translation [2022-12-13 03:19:23,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:23 WrapperNode [2022-12-13 03:19:23,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 03:19:23,255 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 03:19:23,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 03:19:23,255 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 03:19:23,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:23" (1/1) ... [2022-12-13 03:19:23,294 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:23" (1/1) ... [2022-12-13 03:19:23,328 INFO L138 Inliner]: procedures = 469, calls = 63, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 143 [2022-12-13 03:19:23,329 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 03:19:23,330 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 03:19:23,330 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 03:19:23,330 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 03:19:23,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:23" (1/1) ... [2022-12-13 03:19:23,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:23" (1/1) ... [2022-12-13 03:19:23,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:23" (1/1) ... [2022-12-13 03:19:23,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:23" (1/1) ... [2022-12-13 03:19:23,360 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:23" (1/1) ... [2022-12-13 03:19:23,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:23" (1/1) ... [2022-12-13 03:19:23,366 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:23" (1/1) ... [2022-12-13 03:19:23,367 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:23" (1/1) ... [2022-12-13 03:19:23,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 03:19:23,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 03:19:23,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 03:19:23,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 03:19:23,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:23" (1/1) ... [2022-12-13 03:19:23,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 03:19:23,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 03:19:23,419 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 03:19:23,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 03:19:23,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 03:19:23,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 03:19:23,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 03:19:23,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 03:19:23,446 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 03:19:23,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 03:19:23,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 03:19:23,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 03:19:23,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 03:19:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-12-13 03:19:23,447 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-12-13 03:19:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 03:19:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 03:19:23,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 03:19:23,448 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 03:19:23,647 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 03:19:23,648 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 03:19:23,804 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 03:19:23,836 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 03:19:23,836 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 03:19:23,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:19:23 BoogieIcfgContainer [2022-12-13 03:19:23,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 03:19:23,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 03:19:23,840 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 03:19:23,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 03:19:23,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:19:22" (1/3) ... [2022-12-13 03:19:23,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a74c0db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:19:23, skipping insertion in model container [2022-12-13 03:19:23,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:19:23" (2/3) ... [2022-12-13 03:19:23,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a74c0db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:19:23, skipping insertion in model container [2022-12-13 03:19:23,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:19:23" (3/3) ... [2022-12-13 03:19:23,844 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_3-container_of.i [2022-12-13 03:19:23,858 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 03:19:23,858 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-12-13 03:19:23,858 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 03:19:23,928 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 03:19:23,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 158 transitions, 332 flow [2022-12-13 03:19:24,021 INFO L130 PetriNetUnfolder]: 8/196 cut-off events. [2022-12-13 03:19:24,022 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 03:19:24,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 196 events. 8/196 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 340 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 103. Up to 4 conditions per place. [2022-12-13 03:19:24,027 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 158 transitions, 332 flow [2022-12-13 03:19:24,033 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 146 transitions, 304 flow [2022-12-13 03:19:24,034 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:19:24,047 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 146 transitions, 304 flow [2022-12-13 03:19:24,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 146 transitions, 304 flow [2022-12-13 03:19:24,092 INFO L130 PetriNetUnfolder]: 5/177 cut-off events. [2022-12-13 03:19:24,093 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 03:19:24,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 177 events. 5/177 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 288 event pairs, 0 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 93. Up to 4 conditions per place. [2022-12-13 03:19:24,096 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 146 transitions, 304 flow [2022-12-13 03:19:24,096 INFO L226 LiptonReduction]: Number of co-enabled transitions 2704 [2022-12-13 03:20:23,165 INFO L241 LiptonReduction]: Total number of compositions: 114 [2022-12-13 03:20:23,188 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 03:20:23,192 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;@42d5a05c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 03:20:23,193 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-13 03:20:23,201 INFO L130 PetriNetUnfolder]: 0/14 cut-off events. [2022-12-13 03:20:23,201 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 03:20:23,201 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:23,202 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 03:20:23,202 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:23,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:23,206 INFO L85 PathProgramCache]: Analyzing trace with hash 576236, now seen corresponding path program 1 times [2022-12-13 03:20:23,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:23,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181077598] [2022-12-13 03:20:23,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:23,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:20:23,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:23,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181077598] [2022-12-13 03:20:23,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181077598] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:23,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:23,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 03:20:23,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090784937] [2022-12-13 03:20:23,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:23,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 03:20:23,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:23,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 03:20:23,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 03:20:23,508 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 52 [2022-12-13 03:20:23,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 116 flow. Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:23,510 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:23,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 52 [2022-12-13 03:20:23,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:23,886 INFO L130 PetriNetUnfolder]: 2119/3699 cut-off events. [2022-12-13 03:20:23,886 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-13 03:20:23,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7120 conditions, 3699 events. 2119/3699 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 25591 event pairs, 2118 based on Foata normal form. 111/1927 useless extension candidates. Maximal degree in co-relation 6990. Up to 3383 conditions per place. [2022-12-13 03:20:23,908 INFO L137 encePairwiseOnDemand]: 51/52 looper letters, 41 selfloop transitions, 0 changer transitions 0/51 dead transitions. [2022-12-13 03:20:23,908 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 51 transitions, 196 flow [2022-12-13 03:20:23,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 03:20:23,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 03:20:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-12-13 03:20:23,918 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5961538461538461 [2022-12-13 03:20:23,921 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 1 predicate places. [2022-12-13 03:20:23,921 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 51 transitions, 196 flow [2022-12-13 03:20:23,934 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 51 transitions, 196 flow [2022-12-13 03:20:23,946 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:23,947 INFO L89 Accepts]: Start accepts. Operand has 57 places, 51 transitions, 196 flow [2022-12-13 03:20:23,949 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:23,950 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:23,950 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 51 transitions, 196 flow [2022-12-13 03:20:23,964 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 51 transitions, 196 flow [2022-12-13 03:20:23,968 INFO L226 LiptonReduction]: Number of co-enabled transitions 456 [2022-12-13 03:20:34,839 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:20:34,840 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:20:34,843 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 03:20:34,843 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 03:20:39,410 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:20:39,412 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15466 [2022-12-13 03:20:39,412 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 192 flow [2022-12-13 03:20:39,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:39,412 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:39,412 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 03:20:39,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 03:20:39,412 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:39,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:39,413 INFO L85 PathProgramCache]: Analyzing trace with hash 17857647, now seen corresponding path program 1 times [2022-12-13 03:20:39,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:39,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62241400] [2022-12-13 03:20:39,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:39,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:39,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:20:39,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:39,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62241400] [2022-12-13 03:20:39,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62241400] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:39,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:39,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:20:39,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803900164] [2022-12-13 03:20:39,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:39,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:20:39,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:39,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:20:39,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:20:39,667 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 50 [2022-12-13 03:20:39,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:39,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:39,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 50 [2022-12-13 03:20:39,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:40,200 INFO L130 PetriNetUnfolder]: 3816/6250 cut-off events. [2022-12-13 03:20:40,201 INFO L131 PetriNetUnfolder]: For 345/345 co-relation queries the response was YES. [2022-12-13 03:20:40,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17491 conditions, 6250 events. 3816/6250 cut-off events. For 345/345 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 39146 event pairs, 2506 based on Foata normal form. 0/3591 useless extension candidates. Maximal degree in co-relation 17247. Up to 5109 conditions per place. [2022-12-13 03:20:40,230 INFO L137 encePairwiseOnDemand]: 43/50 looper letters, 65 selfloop transitions, 6 changer transitions 0/75 dead transitions. [2022-12-13 03:20:40,230 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 75 transitions, 426 flow [2022-12-13 03:20:40,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:20:40,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:20:40,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-12-13 03:20:40,231 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.56 [2022-12-13 03:20:40,232 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 2 predicate places. [2022-12-13 03:20:40,232 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 75 transitions, 426 flow [2022-12-13 03:20:40,253 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 75 transitions, 426 flow [2022-12-13 03:20:40,271 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:40,271 INFO L89 Accepts]: Start accepts. Operand has 58 places, 75 transitions, 426 flow [2022-12-13 03:20:40,271 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:40,272 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:40,272 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 75 transitions, 426 flow [2022-12-13 03:20:40,273 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 75 transitions, 426 flow [2022-12-13 03:20:40,273 INFO L226 LiptonReduction]: Number of co-enabled transitions 324 [2022-12-13 03:20:40,276 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:40,276 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-13 03:20:40,277 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 75 transitions, 426 flow [2022-12-13 03:20:40,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:40,277 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:40,277 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 03:20:40,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 03:20:40,277 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:40,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:40,277 INFO L85 PathProgramCache]: Analyzing trace with hash 553586206, now seen corresponding path program 1 times [2022-12-13 03:20:40,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:40,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628291561] [2022-12-13 03:20:40,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:40,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:20:40,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:40,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628291561] [2022-12-13 03:20:40,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628291561] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:40,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:40,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:20:40,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390061725] [2022-12-13 03:20:40,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:40,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:20:40,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:40,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:20:40,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:20:40,407 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 50 [2022-12-13 03:20:40,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 75 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:40,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:40,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 50 [2022-12-13 03:20:40,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:40,987 INFO L130 PetriNetUnfolder]: 3955/6510 cut-off events. [2022-12-13 03:20:40,987 INFO L131 PetriNetUnfolder]: For 399/399 co-relation queries the response was YES. [2022-12-13 03:20:40,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24627 conditions, 6510 events. 3955/6510 cut-off events. For 399/399 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 41214 event pairs, 2563 based on Foata normal form. 240/3918 useless extension candidates. Maximal degree in co-relation 24305. Up to 5337 conditions per place. [2022-12-13 03:20:41,010 INFO L137 encePairwiseOnDemand]: 44/50 looper letters, 104 selfloop transitions, 10 changer transitions 2/120 dead transitions. [2022-12-13 03:20:41,010 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 120 transitions, 916 flow [2022-12-13 03:20:41,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:20:41,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:20:41,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2022-12-13 03:20:41,012 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5533333333333333 [2022-12-13 03:20:41,012 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 4 predicate places. [2022-12-13 03:20:41,012 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 120 transitions, 916 flow [2022-12-13 03:20:41,032 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 118 transitions, 900 flow [2022-12-13 03:20:41,055 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:41,055 INFO L89 Accepts]: Start accepts. Operand has 60 places, 118 transitions, 900 flow [2022-12-13 03:20:41,055 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:41,055 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:41,056 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 118 transitions, 900 flow [2022-12-13 03:20:41,058 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 118 transitions, 900 flow [2022-12-13 03:20:41,058 INFO L226 LiptonReduction]: Number of co-enabled transitions 480 [2022-12-13 03:20:41,116 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:20:41,117 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 63 [2022-12-13 03:20:41,117 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 118 transitions, 900 flow [2022-12-13 03:20:41,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:41,118 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:41,118 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:41,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 03:20:41,118 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:41,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:41,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1409752959, now seen corresponding path program 1 times [2022-12-13 03:20:41,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:41,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034841209] [2022-12-13 03:20:41,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:41,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:41,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:20:41,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:41,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034841209] [2022-12-13 03:20:41,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034841209] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:41,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:41,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:20:41,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703842494] [2022-12-13 03:20:41,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:41,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:20:41,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:41,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:20:41,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:20:41,288 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 49 [2022-12-13 03:20:41,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 118 transitions, 900 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:41,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:41,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 49 [2022-12-13 03:20:41,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:42,008 INFO L130 PetriNetUnfolder]: 4875/7974 cut-off events. [2022-12-13 03:20:42,008 INFO L131 PetriNetUnfolder]: For 512/512 co-relation queries the response was YES. [2022-12-13 03:20:42,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37989 conditions, 7974 events. 4875/7974 cut-off events. For 512/512 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 51839 event pairs, 1362 based on Foata normal form. 0/4624 useless extension candidates. Maximal degree in co-relation 37440. Up to 6642 conditions per place. [2022-12-13 03:20:42,043 INFO L137 encePairwiseOnDemand]: 40/49 looper letters, 136 selfloop transitions, 8 changer transitions 0/148 dead transitions. [2022-12-13 03:20:42,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 148 transitions, 1421 flow [2022-12-13 03:20:42,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:20:42,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:20:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-12-13 03:20:42,045 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5986394557823129 [2022-12-13 03:20:42,045 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 6 predicate places. [2022-12-13 03:20:42,045 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 148 transitions, 1421 flow [2022-12-13 03:20:42,077 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 148 transitions, 1421 flow [2022-12-13 03:20:42,111 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:42,111 INFO L89 Accepts]: Start accepts. Operand has 62 places, 148 transitions, 1421 flow [2022-12-13 03:20:42,112 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:42,112 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:42,112 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 148 transitions, 1421 flow [2022-12-13 03:20:42,115 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 148 transitions, 1421 flow [2022-12-13 03:20:42,116 INFO L226 LiptonReduction]: Number of co-enabled transitions 624 [2022-12-13 03:20:42,154 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 03:20:42,155 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 44 [2022-12-13 03:20:42,155 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 148 transitions, 1423 flow [2022-12-13 03:20:42,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:42,155 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:42,155 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:42,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 03:20:42,155 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:42,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:42,156 INFO L85 PathProgramCache]: Analyzing trace with hash 752669102, now seen corresponding path program 1 times [2022-12-13 03:20:42,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:42,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142979456] [2022-12-13 03:20:42,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:42,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 03:20:42,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 03:20:42,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 03:20:42,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142979456] [2022-12-13 03:20:42,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142979456] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 03:20:42,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 03:20:42,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 03:20:42,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864720893] [2022-12-13 03:20:42,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 03:20:42,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 03:20:42,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 03:20:42,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 03:20:42,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 03:20:42,243 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 50 [2022-12-13 03:20:42,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 148 transitions, 1423 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:42,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 03:20:42,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 50 [2022-12-13 03:20:42,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 03:20:43,115 INFO L130 PetriNetUnfolder]: 5630/9177 cut-off events. [2022-12-13 03:20:43,115 INFO L131 PetriNetUnfolder]: For 593/593 co-relation queries the response was YES. [2022-12-13 03:20:43,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52858 conditions, 9177 events. 5630/9177 cut-off events. For 593/593 co-relation queries the response was YES. Maximal size of possible extension queue 456. Compared 60613 event pairs, 1424 based on Foata normal form. 0/5380 useless extension candidates. Maximal degree in co-relation 51967. Up to 7740 conditions per place. [2022-12-13 03:20:43,192 INFO L137 encePairwiseOnDemand]: 40/50 looper letters, 179 selfloop transitions, 16 changer transitions 0/199 dead transitions. [2022-12-13 03:20:43,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 199 transitions, 2314 flow [2022-12-13 03:20:43,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 03:20:43,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 03:20:43,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-12-13 03:20:43,193 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2022-12-13 03:20:43,194 INFO L295 CegarLoopForPetriNet]: 56 programPoint places, 8 predicate places. [2022-12-13 03:20:43,194 INFO L82 GeneralOperation]: Start removeDead. Operand has 64 places, 199 transitions, 2314 flow [2022-12-13 03:20:43,224 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 64 places, 199 transitions, 2314 flow [2022-12-13 03:20:43,258 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 03:20:43,259 INFO L89 Accepts]: Start accepts. Operand has 64 places, 199 transitions, 2314 flow [2022-12-13 03:20:43,259 INFO L95 Accepts]: Finished accepts. [2022-12-13 03:20:43,259 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 03:20:43,260 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 199 transitions, 2314 flow [2022-12-13 03:20:43,264 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 199 transitions, 2314 flow [2022-12-13 03:20:43,264 INFO L226 LiptonReduction]: Number of co-enabled transitions 820 [2022-12-13 03:20:43,268 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 03:20:43,269 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-13 03:20:43,269 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 199 transitions, 2314 flow [2022-12-13 03:20:43,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 03:20:43,269 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 03:20:43,269 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 03:20:43,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 03:20:43,269 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 03:20:43,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 03:20:43,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1831699914, now seen corresponding path program 1 times [2022-12-13 03:20:43,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 03:20:43,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239944312] [2022-12-13 03:20:43,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 03:20:43,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 03:20:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 03:20:43,298 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 03:20:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 03:20:43,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 03:20:43,326 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 03:20:43,327 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2022-12-13 03:20:43,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2022-12-13 03:20:43,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2022-12-13 03:20:43,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2022-12-13 03:20:43,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2022-12-13 03:20:43,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2022-12-13 03:20:43,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2022-12-13 03:20:43,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2022-12-13 03:20:43,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 03:20:43,329 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-12-13 03:20:43,333 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 03:20:43,333 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 03:20:43,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:20:43 BasicIcfg [2022-12-13 03:20:43,353 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 03:20:43,353 INFO L158 Benchmark]: Toolchain (without parser) took 80866.73ms. Allocated memory was 224.4MB in the beginning and 629.1MB in the end (delta: 404.8MB). Free memory was 197.5MB in the beginning and 375.4MB in the end (delta: -177.9MB). Peak memory consumption was 227.4MB. Max. memory is 8.0GB. [2022-12-13 03:20:43,353 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 224.4MB. Free memory is still 201.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 03:20:43,353 INFO L158 Benchmark]: CACSL2BoogieTranslator took 764.69ms. Allocated memory is still 224.4MB. Free memory was 197.5MB in the beginning and 140.9MB in the end (delta: 56.6MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. [2022-12-13 03:20:43,353 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.15ms. Allocated memory is still 224.4MB. Free memory was 140.9MB in the beginning and 137.2MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 03:20:43,353 INFO L158 Benchmark]: Boogie Preprocessor took 41.23ms. Allocated memory is still 224.4MB. Free memory was 137.2MB in the beginning and 134.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 03:20:43,354 INFO L158 Benchmark]: RCFGBuilder took 466.22ms. Allocated memory is still 224.4MB. Free memory was 134.6MB in the beginning and 106.8MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-12-13 03:20:43,354 INFO L158 Benchmark]: TraceAbstraction took 79513.16ms. Allocated memory was 224.4MB in the beginning and 629.1MB in the end (delta: 404.8MB). Free memory was 105.8MB in the beginning and 375.4MB in the end (delta: -269.6MB). Peak memory consumption was 136.2MB. Max. memory is 8.0GB. [2022-12-13 03:20:43,355 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 224.4MB. Free memory is still 201.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 764.69ms. Allocated memory is still 224.4MB. Free memory was 197.5MB in the beginning and 140.9MB in the end (delta: 56.6MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 74.15ms. Allocated memory is still 224.4MB. Free memory was 140.9MB in the beginning and 137.2MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 41.23ms. Allocated memory is still 224.4MB. Free memory was 137.2MB in the beginning and 134.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 466.22ms. Allocated memory is still 224.4MB. Free memory was 134.6MB in the beginning and 106.8MB in the end (delta: 27.8MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 79513.16ms. Allocated memory was 224.4MB in the beginning and 629.1MB in the end (delta: 404.8MB). Free memory was 105.8MB in the beginning and 375.4MB in the end (delta: -269.6MB). Peak memory consumption was 136.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 59.1s, 148 PlacesBefore, 56 PlacesAfterwards, 146 TransitionsBefore, 52 TransitionsAfterwards, 2704 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 60 TrivialYvCompositions, 49 ConcurrentYvCompositions, 2 ChoiceCompositions, 114 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3028, independent: 2885, independent conditional: 2885, independent unconditional: 0, dependent: 78, dependent conditional: 78, dependent unconditional: 0, unknown: 65, unknown conditional: 65, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3028, independent: 2885, independent conditional: 0, independent unconditional: 2885, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 65, unknown conditional: 0, unknown unconditional: 65] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3028, independent: 2885, independent conditional: 0, independent unconditional: 2885, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 65, unknown conditional: 0, unknown unconditional: 65] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3028, independent: 2885, independent conditional: 0, independent unconditional: 2885, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 65, unknown conditional: 0, unknown unconditional: 65] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1856, independent: 1795, independent conditional: 0, independent unconditional: 1795, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 22, unknown conditional: 0, unknown unconditional: 22] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1856, independent: 1786, independent conditional: 0, independent unconditional: 1786, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 70, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 22, unknown conditional: 0, unknown unconditional: 22] , SemanticIndependenceRelation.Query Time [ms]: [ total: 48705, independent: 111, independent conditional: 0, independent unconditional: 111, dependent: 953, dependent conditional: 0, dependent unconditional: 953, unknown: 47641, unknown conditional: 0, unknown unconditional: 47641] ], Cache Queries: [ total: 3028, independent: 1090, independent conditional: 0, independent unconditional: 1090, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 1899, unknown conditional: 0, unknown unconditional: 1899] , Statistics on independence cache: Total cache size (in pairs): 4068, Positive cache size: 4029, Positive conditional cache size: 0, Positive unconditional cache size: 4029, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Unknown cache size: 22, Unknown conditional cache size: 0, Unknown unconditional cache size: 22, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.4s, 57 PlacesBefore, 56 PlacesAfterwards, 51 TransitionsBefore, 50 TransitionsAfterwards, 456 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 136, independent: 106, independent conditional: 106, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 26, unknown conditional: 26, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 136, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 26, unknown conditional: 0, unknown unconditional: 26] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 136, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 26, unknown conditional: 0, unknown unconditional: 26] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 136, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 26, unknown conditional: 0, unknown unconditional: 26] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 48, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 48, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , SemanticIndependenceRelation.Query Time [ms]: [ total: 15189, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 15042, unknown conditional: 0, unknown unconditional: 15042] ], Cache Queries: [ total: 136, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 67, unknown conditional: 0, unknown unconditional: 67] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 7, Unknown conditional cache size: 0, Unknown unconditional cache size: 7, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 58 PlacesBefore, 58 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 324 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 7, Unknown conditional cache size: 0, Unknown unconditional cache size: 7, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 60 PlacesBefore, 60 PlacesAfterwards, 118 TransitionsBefore, 118 TransitionsAfterwards, 480 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 43, Positive conditional cache size: 0, Positive unconditional cache size: 43, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 7, Unknown conditional cache size: 0, Unknown unconditional cache size: 7, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 62 PlacesBefore, 62 PlacesAfterwards, 148 TransitionsBefore, 148 TransitionsAfterwards, 624 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 45, Positive conditional cache size: 0, Positive unconditional cache size: 45, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 7, Unknown conditional cache size: 0, Unknown unconditional cache size: 7, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 64 PlacesBefore, 64 PlacesAfterwards, 199 TransitionsBefore, 199 TransitionsAfterwards, 820 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 47, Positive cache size: 45, Positive conditional cache size: 0, Positive unconditional cache size: 45, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 7, Unknown conditional cache size: 0, Unknown unconditional cache size: 7, Eliminated conditions: 0, Maximal queried relation: -1 - CounterExampleResult [Line: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; [L1745] CALL, EXPR 0 my_drv_init() [L1739] 0 return 0; [L1745] RET, EXPR 0 my_drv_init() [L1745] 0 int ret = my_drv_init(); [L1746] COND TRUE 0 ret==0 [L1747] 0 int probe_ret; [L1748] 0 struct my_data data; [L1749] CALL 0 my_drv_probe(&data) [L1706] 0 struct device *d = &data->dev; [L1708] 0 data->shared.a = 0 [L1709] 0 data->shared.b = 0 [L1710] 0 int res = __VERIFIER_nondet_int(); [L1711] COND FALSE 0 !(\read(res)) [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={5:24}, d={5:24}, data={5:0}, data={5:0}, pthread_create(&t1, ((void *)0), my_callback, (void *)d)=-2, res=0, t1={3:0}, t2={4:0}] [L1689] 1 struct device *dev = (struct device*)arg; [L1690] 1 struct my_data *data; [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, pthread_create(&t2, ((void *)0), my_callback, (void *)d)=-1, pthread_mutex_lock (&data->lock)=0, res=0, t1={3:0}, t2={4:0}] [L1716] 0 data->shared.a = 3 VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, pthread_mutex_lock (&data->lock)=0, res=0, t1={3:0}, t2={4:0}] [L1719] 0 data->shared.b = 3 VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, pthread_mutex_lock (&data->lock)=0, res=0, t1={3:0}, t2={4:0}] [L1694] 1 data->shared.a = 1 VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1={3:0}, t2={4:0}] [L1722] EXPR 0 data->shared.a [L1722] CALL 0 ldv_assert(data->shared.a==3) [L1675] COND TRUE 0 !expression [L1675] 0 reach_error() VAL [\old(expression)=0, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, t1={3:0}, t2={4:0}] - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1713]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1714]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 168 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 79.4s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 59.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 488 IncrementalHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 20 mSDtfsCounter, 488 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2314occurred in iteration=5, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 03:20:43,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...