/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 --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_4-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 06:28:42,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 06:28:42,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 06:28:42,808 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 06:28:42,808 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 06:28:42,810 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 06:28:42,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 06:28:42,817 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 06:28:42,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 06:28:42,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 06:28:42,824 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 06:28:42,825 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 06:28:42,825 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 06:28:42,827 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 06:28:42,828 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 06:28:42,830 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 06:28:42,830 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 06:28:42,831 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 06:28:42,833 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 06:28:42,837 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 06:28:42,837 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 06:28:42,839 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 06:28:42,839 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 06:28:42,840 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 06:28:42,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 06:28:42,845 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 06:28:42,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 06:28:42,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 06:28:42,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 06:28:42,846 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 06:28:42,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 06:28:42,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 06:28:42,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 06:28:42,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 06:28:42,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 06:28:42,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 06:28:42,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 06:28:42,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 06:28:42,849 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 06:28:42,850 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 06:28:42,850 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 06:28:42,851 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 06:28:42,871 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 06:28:42,872 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 06:28:42,873 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 06:28:42,873 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 06:28:42,874 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 06:28:42,874 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 06:28:42,874 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 06:28:42,874 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 06:28:42,874 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 06:28:42,875 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 06:28:42,875 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 06:28:42,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 06:28:42,886 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 06:28:42,886 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 06:28:42,886 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 06:28:42,886 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 06:28:42,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 06:28:42,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 06:28:42,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 06:28:42,886 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 06:28:42,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 06:28:42,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:28:42,887 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 06:28:42,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 06:28:42,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 06:28:42,887 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 06:28:42,887 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 06:28:42,887 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 06:28:42,887 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-13 06:28:43,164 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 06:28:43,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 06:28:43,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 06:28:43,193 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 06:28:43,193 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 06:28:43,194 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_4-container_of.i [2022-12-13 06:28:44,156 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 06:28:44,484 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 06:28:44,485 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_4-container_of.i [2022-12-13 06:28:44,506 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81a8cef6a/ef4e7b08bafe4cce8222985786ef03ff/FLAG607a65109 [2022-12-13 06:28:44,522 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81a8cef6a/ef4e7b08bafe4cce8222985786ef03ff [2022-12-13 06:28:44,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 06:28:44,526 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 06:28:44,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 06:28:44,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 06:28:44,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 06:28:44,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:28:44" (1/1) ... [2022-12-13 06:28:44,533 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3416555e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:44, skipping insertion in model container [2022-12-13 06:28:44,533 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:28:44" (1/1) ... [2022-12-13 06:28:44,538 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 06:28:44,593 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 06:28:44,732 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 06:28:45,022 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_4-container_of.i[75002,75015] [2022-12-13 06:28:45,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:28:45,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:28:45,028 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:28:45,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:28:45,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:28:45,029 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:28:45,045 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:28:45,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:28:45,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:28:45,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:28:45,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:28:45,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:28:45,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:28:45,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:28:45,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:28:45,063 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 06:28:45,078 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 06:28:45,111 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_4-container_of.i[75002,75015] [2022-12-13 06:28:45,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:28:45,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:28:45,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:28:45,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:28:45,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:28:45,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:28:45,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:28:45,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:28:45,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:28:45,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:28:45,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:28:45,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:28:45,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 06:28:45,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 06:28:45,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 06:28:45,210 INFO L208 MainTranslator]: Completed translation [2022-12-13 06:28:45,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:45 WrapperNode [2022-12-13 06:28:45,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 06:28:45,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 06:28:45,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 06:28:45,213 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 06:28:45,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:45" (1/1) ... [2022-12-13 06:28:45,245 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:45" (1/1) ... [2022-12-13 06:28:45,265 INFO L138 Inliner]: procedures = 469, calls = 63, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 143 [2022-12-13 06:28:45,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 06:28:45,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 06:28:45,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 06:28:45,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 06:28:45,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:45" (1/1) ... [2022-12-13 06:28:45,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:45" (1/1) ... [2022-12-13 06:28:45,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:45" (1/1) ... [2022-12-13 06:28:45,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:45" (1/1) ... [2022-12-13 06:28:45,284 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:45" (1/1) ... [2022-12-13 06:28:45,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:45" (1/1) ... [2022-12-13 06:28:45,289 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:45" (1/1) ... [2022-12-13 06:28:45,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:45" (1/1) ... [2022-12-13 06:28:45,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 06:28:45,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 06:28:45,306 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 06:28:45,306 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 06:28:45,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:45" (1/1) ... [2022-12-13 06:28:45,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 06:28:45,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 06:28:45,340 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 06:28:45,361 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 06:28:45,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 06:28:45,373 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 06:28:45,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 06:28:45,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 06:28:45,374 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-13 06:28:45,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 06:28:45,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 06:28:45,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 06:28:45,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 06:28:45,375 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-12-13 06:28:45,375 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-12-13 06:28:45,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 06:28:45,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 06:28:45,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 06:28:45,376 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 06:28:45,584 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 06:28:45,586 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 06:28:45,884 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 06:28:45,923 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 06:28:45,923 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 06:28:45,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:28:45 BoogieIcfgContainer [2022-12-13 06:28:45,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 06:28:45,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 06:28:45,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 06:28:45,934 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 06:28:45,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:28:44" (1/3) ... [2022-12-13 06:28:45,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366c9e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:28:45, skipping insertion in model container [2022-12-13 06:28:45,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:28:45" (2/3) ... [2022-12-13 06:28:45,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366c9e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:28:45, skipping insertion in model container [2022-12-13 06:28:45,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:28:45" (3/3) ... [2022-12-13 06:28:45,936 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_4-container_of.i [2022-12-13 06:28:45,950 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 06:28:45,950 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-12-13 06:28:45,950 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 06:28:46,014 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 06:28:46,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 158 transitions, 332 flow [2022-12-13 06:28:46,110 INFO L130 PetriNetUnfolder]: 8/202 cut-off events. [2022-12-13 06:28:46,110 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 06:28:46,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 202 events. 8/202 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 393 event pairs, 0 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 109. Up to 4 conditions per place. [2022-12-13 06:28:46,115 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 158 transitions, 332 flow [2022-12-13 06:28:46,122 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 146 transitions, 304 flow [2022-12-13 06:28:46,124 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:28:46,139 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 146 transitions, 304 flow [2022-12-13 06:28:46,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 146 transitions, 304 flow [2022-12-13 06:28:46,182 INFO L130 PetriNetUnfolder]: 5/183 cut-off events. [2022-12-13 06:28:46,182 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 06:28:46,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 183 events. 5/183 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 344 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 99. Up to 4 conditions per place. [2022-12-13 06:28:46,186 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 146 transitions, 304 flow [2022-12-13 06:28:46,186 INFO L226 LiptonReduction]: Number of co-enabled transitions 2704 [2022-12-13 06:29:31,809 INFO L241 LiptonReduction]: Total number of compositions: 113 [2022-12-13 06:29:31,819 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 06:29:31,823 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;@661131fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 06:29:31,823 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-13 06:29:31,826 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-13 06:29:31,826 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 06:29:31,826 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:31,827 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 06:29:31,827 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:31,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:31,830 INFO L85 PathProgramCache]: Analyzing trace with hash 584666, now seen corresponding path program 1 times [2022-12-13 06:29:31,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:31,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582361097] [2022-12-13 06:29:31,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:31,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:32,062 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 06:29:32,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:32,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582361097] [2022-12-13 06:29:32,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582361097] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:32,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:32,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 06:29:32,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423027094] [2022-12-13 06:29:32,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:32,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 06:29:32,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:32,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 06:29:32,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 06:29:32,099 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 53 [2022-12-13 06:29:32,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 118 flow. Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:29:32,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:32,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 53 [2022-12-13 06:29:32,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:32,438 INFO L130 PetriNetUnfolder]: 2119/3865 cut-off events. [2022-12-13 06:29:32,438 INFO L131 PetriNetUnfolder]: For 43/43 co-relation queries the response was YES. [2022-12-13 06:29:32,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7290 conditions, 3865 events. 2119/3865 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 28504 event pairs, 2118 based on Foata normal form. 111/2071 useless extension candidates. Maximal degree in co-relation 7150. Up to 3387 conditions per place. [2022-12-13 06:29:32,458 INFO L137 encePairwiseOnDemand]: 52/53 looper letters, 41 selfloop transitions, 0 changer transitions 0/52 dead transitions. [2022-12-13 06:29:32,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 52 transitions, 198 flow [2022-12-13 06:29:32,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 06:29:32,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 06:29:32,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2022-12-13 06:29:32,469 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6037735849056604 [2022-12-13 06:29:32,473 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 1 predicate places. [2022-12-13 06:29:32,473 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 52 transitions, 198 flow [2022-12-13 06:29:32,485 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 52 transitions, 198 flow [2022-12-13 06:29:32,495 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:32,497 INFO L89 Accepts]: Start accepts. Operand has 58 places, 52 transitions, 198 flow [2022-12-13 06:29:32,499 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:32,500 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:32,501 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 52 transitions, 198 flow [2022-12-13 06:29:32,507 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 52 transitions, 198 flow [2022-12-13 06:29:32,511 INFO L226 LiptonReduction]: Number of co-enabled transitions 508 [2022-12-13 06:29:43,517 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:29:43,518 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:29:43,520 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 06:29:43,521 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2022-12-13 06:29:45,943 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:29:45,949 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13454 [2022-12-13 06:29:45,949 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 194 flow [2022-12-13 06:29:45,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 06:29:45,949 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:29:45,949 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 06:29:45,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 06:29:45,950 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:29:45,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:29:45,950 INFO L85 PathProgramCache]: Analyzing trace with hash 18154371, now seen corresponding path program 1 times [2022-12-13 06:29:45,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:29:45,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406872563] [2022-12-13 06:29:45,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:29:45,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:29:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:29:46,112 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 06:29:46,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:29:46,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406872563] [2022-12-13 06:29:46,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406872563] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:29:46,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:29:46,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:29:46,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235744377] [2022-12-13 06:29:46,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:29:46,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:29:46,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:29:46,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:29:46,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:29:46,115 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 51 [2022-12-13 06:29:46,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 06:29:46,115 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:29:46,115 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 51 [2022-12-13 06:29:46,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:29:46,497 INFO L130 PetriNetUnfolder]: 2118/3773 cut-off events. [2022-12-13 06:29:46,498 INFO L131 PetriNetUnfolder]: For 346/446 co-relation queries the response was YES. [2022-12-13 06:29:46,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10579 conditions, 3773 events. 2118/3773 cut-off events. For 346/446 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 26193 event pairs, 1322 based on Foata normal form. 0/1889 useless extension candidates. Maximal degree in co-relation 10393. Up to 3384 conditions per place. [2022-12-13 06:29:46,518 INFO L137 encePairwiseOnDemand]: 48/51 looper letters, 61 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2022-12-13 06:29:46,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 412 flow [2022-12-13 06:29:46,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:29:46,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:29:46,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2022-12-13 06:29:46,521 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6339869281045751 [2022-12-13 06:29:46,521 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 2 predicate places. [2022-12-13 06:29:46,522 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 74 transitions, 412 flow [2022-12-13 06:29:46,536 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 74 transitions, 412 flow [2022-12-13 06:29:46,552 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:29:46,553 INFO L89 Accepts]: Start accepts. Operand has 59 places, 74 transitions, 412 flow [2022-12-13 06:29:46,554 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:29:46,554 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:29:46,554 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 74 transitions, 412 flow [2022-12-13 06:29:46,557 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 74 transitions, 412 flow [2022-12-13 06:29:46,557 INFO L226 LiptonReduction]: Number of co-enabled transitions 642 [2022-12-13 06:30:03,716 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:30:03,717 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17165 [2022-12-13 06:30:03,717 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 74 transitions, 412 flow [2022-12-13 06:30:03,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 06:30:03,717 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:03,717 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 06:30:03,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 06:30:03,717 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:03,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:03,718 INFO L85 PathProgramCache]: Analyzing trace with hash 18119010, now seen corresponding path program 1 times [2022-12-13 06:30:03,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:03,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555323555] [2022-12-13 06:30:03,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:03,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:04,019 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 06:30:04,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:04,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555323555] [2022-12-13 06:30:04,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555323555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:04,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:04,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:30:04,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135884656] [2022-12-13 06:30:04,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:04,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:30:04,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:04,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:30:04,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:30:04,021 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 51 [2022-12-13 06:30:04,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 74 transitions, 412 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 06:30:04,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:04,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 51 [2022-12-13 06:30:04,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:04,553 INFO L130 PetriNetUnfolder]: 4079/6648 cut-off events. [2022-12-13 06:30:04,554 INFO L131 PetriNetUnfolder]: For 1828/1828 co-relation queries the response was YES. [2022-12-13 06:30:04,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23866 conditions, 6648 events. 4079/6648 cut-off events. For 1828/1828 co-relation queries the response was YES. Maximal size of possible extension queue 362. Compared 41690 event pairs, 2370 based on Foata normal form. 0/3846 useless extension candidates. Maximal degree in co-relation 23553. Up to 5338 conditions per place. [2022-12-13 06:30:04,589 INFO L137 encePairwiseOnDemand]: 44/51 looper letters, 87 selfloop transitions, 7 changer transitions 0/98 dead transitions. [2022-12-13 06:30:04,589 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 98 transitions, 728 flow [2022-12-13 06:30:04,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:30:04,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:30:04,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2022-12-13 06:30:04,590 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-13 06:30:04,591 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 4 predicate places. [2022-12-13 06:30:04,591 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 98 transitions, 728 flow [2022-12-13 06:30:04,613 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 61 places, 98 transitions, 728 flow [2022-12-13 06:30:04,633 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:04,633 INFO L89 Accepts]: Start accepts. Operand has 61 places, 98 transitions, 728 flow [2022-12-13 06:30:04,634 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:04,634 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:04,634 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 98 transitions, 728 flow [2022-12-13 06:30:04,636 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 98 transitions, 728 flow [2022-12-13 06:30:04,636 INFO L226 LiptonReduction]: Number of co-enabled transitions 382 [2022-12-13 06:30:04,640 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:30:04,641 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-13 06:30:04,641 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 98 transitions, 728 flow [2022-12-13 06:30:04,641 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 06:30:04,641 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:04,641 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 06:30:04,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 06:30:04,641 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:04,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:04,642 INFO L85 PathProgramCache]: Analyzing trace with hash 561688745, now seen corresponding path program 1 times [2022-12-13 06:30:04,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:04,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748373137] [2022-12-13 06:30:04,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:04,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:04,781 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 06:30:04,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:04,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748373137] [2022-12-13 06:30:04,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748373137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:04,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:04,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:30:04,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971049632] [2022-12-13 06:30:04,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:04,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:30:04,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:04,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:30:04,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:30:04,787 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 51 [2022-12-13 06:30:04,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 98 transitions, 728 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 06:30:04,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:04,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 51 [2022-12-13 06:30:04,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:05,406 INFO L130 PetriNetUnfolder]: 4218/6931 cut-off events. [2022-12-13 06:30:05,406 INFO L131 PetriNetUnfolder]: For 2136/2136 co-relation queries the response was YES. [2022-12-13 06:30:05,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31659 conditions, 6931 events. 4218/6931 cut-off events. For 2136/2136 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 44671 event pairs, 2427 based on Foata normal form. 241/4197 useless extension candidates. Maximal degree in co-relation 31272. Up to 5692 conditions per place. [2022-12-13 06:30:05,436 INFO L137 encePairwiseOnDemand]: 45/51 looper letters, 124 selfloop transitions, 10 changer transitions 4/142 dead transitions. [2022-12-13 06:30:05,437 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 142 transitions, 1332 flow [2022-12-13 06:30:05,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:30:05,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:30:05,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-12-13 06:30:05,443 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5490196078431373 [2022-12-13 06:30:05,444 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 6 predicate places. [2022-12-13 06:30:05,444 INFO L82 GeneralOperation]: Start removeDead. Operand has 63 places, 142 transitions, 1332 flow [2022-12-13 06:30:05,466 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 63 places, 138 transitions, 1292 flow [2022-12-13 06:30:05,487 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:05,487 INFO L89 Accepts]: Start accepts. Operand has 63 places, 138 transitions, 1292 flow [2022-12-13 06:30:05,488 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:05,488 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:05,488 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 138 transitions, 1292 flow [2022-12-13 06:30:05,491 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 138 transitions, 1292 flow [2022-12-13 06:30:05,491 INFO L226 LiptonReduction]: Number of co-enabled transitions 538 [2022-12-13 06:30:05,546 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:30:05,552 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 65 [2022-12-13 06:30:05,552 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 138 transitions, 1292 flow [2022-12-13 06:30:05,552 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 06:30:05,552 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:05,552 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:30:05,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 06:30:05,553 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:05,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:05,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1982324636, now seen corresponding path program 1 times [2022-12-13 06:30:05,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:05,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129194354] [2022-12-13 06:30:05,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:05,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:05,745 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 06:30:05,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:05,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129194354] [2022-12-13 06:30:05,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129194354] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:05,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:05,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:30:05,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606840901] [2022-12-13 06:30:05,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:05,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:30:05,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:05,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:30:05,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:30:05,747 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 50 [2022-12-13 06:30:05,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 138 transitions, 1292 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 06:30:05,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:05,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 50 [2022-12-13 06:30:05,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:06,598 INFO L130 PetriNetUnfolder]: 5044/8352 cut-off events. [2022-12-13 06:30:06,598 INFO L131 PetriNetUnfolder]: For 2580/2580 co-relation queries the response was YES. [2022-12-13 06:30:06,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45916 conditions, 8352 events. 5044/8352 cut-off events. For 2580/2580 co-relation queries the response was YES. Maximal size of possible extension queue 508. Compared 56778 event pairs, 1236 based on Foata normal form. 0/4953 useless extension candidates. Maximal degree in co-relation 45265. Up to 7050 conditions per place. [2022-12-13 06:30:06,632 INFO L137 encePairwiseOnDemand]: 42/50 looper letters, 156 selfloop transitions, 7 changer transitions 0/167 dead transitions. [2022-12-13 06:30:06,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 167 transitions, 1891 flow [2022-12-13 06:30:06,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:30:06,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:30:06,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-12-13 06:30:06,635 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2022-12-13 06:30:06,636 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 8 predicate places. [2022-12-13 06:30:06,636 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 167 transitions, 1891 flow [2022-12-13 06:30:06,666 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 167 transitions, 1891 flow [2022-12-13 06:30:06,697 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:06,697 INFO L89 Accepts]: Start accepts. Operand has 65 places, 167 transitions, 1891 flow [2022-12-13 06:30:06,699 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:06,699 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:06,699 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 167 transitions, 1891 flow [2022-12-13 06:30:06,703 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 167 transitions, 1891 flow [2022-12-13 06:30:06,703 INFO L226 LiptonReduction]: Number of co-enabled transitions 674 [2022-12-13 06:30:06,748 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 06:30:06,749 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 52 [2022-12-13 06:30:06,749 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 167 transitions, 1891 flow [2022-12-13 06:30:06,749 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 06:30:06,749 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:06,750 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:30:06,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 06:30:06,750 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:06,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:06,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1322521937, now seen corresponding path program 1 times [2022-12-13 06:30:06,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:06,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740052250] [2022-12-13 06:30:06,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:06,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 06:30:06,852 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 06:30:06,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 06:30:06,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740052250] [2022-12-13 06:30:06,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740052250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 06:30:06,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 06:30:06,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 06:30:06,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253329571] [2022-12-13 06:30:06,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 06:30:06,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 06:30:06,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 06:30:06,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 06:30:06,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 06:30:06,855 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 51 [2022-12-13 06:30:06,855 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 167 transitions, 1891 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 06:30:06,855 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 06:30:06,855 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 51 [2022-12-13 06:30:06,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 06:30:07,813 INFO L130 PetriNetUnfolder]: 5704/9432 cut-off events. [2022-12-13 06:30:07,814 INFO L131 PetriNetUnfolder]: For 3057/3057 co-relation queries the response was YES. [2022-12-13 06:30:07,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61256 conditions, 9432 events. 5704/9432 cut-off events. For 3057/3057 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 64774 event pairs, 1293 based on Foata normal form. 0/5681 useless extension candidates. Maximal degree in co-relation 60242. Up to 8148 conditions per place. [2022-12-13 06:30:07,865 INFO L137 encePairwiseOnDemand]: 42/51 looper letters, 199 selfloop transitions, 14 changer transitions 0/217 dead transitions. [2022-12-13 06:30:07,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 217 transitions, 2892 flow [2022-12-13 06:30:07,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 06:30:07,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 06:30:07,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-12-13 06:30:07,867 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5751633986928104 [2022-12-13 06:30:07,867 INFO L295 CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places. [2022-12-13 06:30:07,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 217 transitions, 2892 flow [2022-12-13 06:30:07,909 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 217 transitions, 2892 flow [2022-12-13 06:30:08,052 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 06:30:08,052 INFO L89 Accepts]: Start accepts. Operand has 67 places, 217 transitions, 2892 flow [2022-12-13 06:30:08,053 INFO L95 Accepts]: Finished accepts. [2022-12-13 06:30:08,053 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 06:30:08,054 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 217 transitions, 2892 flow [2022-12-13 06:30:08,059 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 217 transitions, 2892 flow [2022-12-13 06:30:08,059 INFO L226 LiptonReduction]: Number of co-enabled transitions 862 [2022-12-13 06:30:08,065 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 06:30:08,066 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-13 06:30:08,066 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 217 transitions, 2892 flow [2022-12-13 06:30:08,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 06:30:08,066 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 06:30:08,066 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:30:08,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 06:30:08,066 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-12-13 06:30:08,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 06:30:08,067 INFO L85 PathProgramCache]: Analyzing trace with hash -205561458, now seen corresponding path program 1 times [2022-12-13 06:30:08,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 06:30:08,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002313410] [2022-12-13 06:30:08,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 06:30:08,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 06:30:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 06:30:08,101 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 06:30:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 06:30:08,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 06:30:08,168 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 06:30:08,169 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2022-12-13 06:30:08,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2022-12-13 06:30:08,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2022-12-13 06:30:08,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2022-12-13 06:30:08,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2022-12-13 06:30:08,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2022-12-13 06:30:08,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2022-12-13 06:30:08,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2022-12-13 06:30:08,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 06:30:08,171 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-12-13 06:30:08,174 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 06:30:08,175 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 06:30:08,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:30:08 BasicIcfg [2022-12-13 06:30:08,216 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 06:30:08,217 INFO L158 Benchmark]: Toolchain (without parser) took 83691.33ms. Allocated memory was 185.6MB in the beginning and 980.4MB in the end (delta: 794.8MB). Free memory was 158.9MB in the beginning and 778.4MB in the end (delta: -619.5MB). Peak memory consumption was 175.9MB. Max. memory is 8.0GB. [2022-12-13 06:30:08,217 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory is still 163.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 06:30:08,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 682.59ms. Allocated memory is still 185.6MB. Free memory was 158.6MB in the beginning and 102.2MB in the end (delta: 56.4MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. [2022-12-13 06:30:08,217 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.00ms. Allocated memory is still 185.6MB. Free memory was 102.2MB in the beginning and 99.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 06:30:08,217 INFO L158 Benchmark]: Boogie Preprocessor took 27.74ms. Allocated memory is still 185.6MB. Free memory was 98.6MB in the beginning and 96.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 06:30:08,218 INFO L158 Benchmark]: RCFGBuilder took 618.78ms. Allocated memory was 185.6MB in the beginning and 239.1MB in the end (delta: 53.5MB). Free memory was 96.0MB in the beginning and 205.0MB in the end (delta: -109.1MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-12-13 06:30:08,218 INFO L158 Benchmark]: TraceAbstraction took 82284.86ms. Allocated memory was 239.1MB in the beginning and 980.4MB in the end (delta: 741.3MB). Free memory was 203.4MB in the beginning and 778.4MB in the end (delta: -574.9MB). Peak memory consumption was 166.4MB. Max. memory is 8.0GB. [2022-12-13 06:30:08,219 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.10ms. Allocated memory is still 185.6MB. Free memory is still 163.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 682.59ms. Allocated memory is still 185.6MB. Free memory was 158.6MB in the beginning and 102.2MB in the end (delta: 56.4MB). Peak memory consumption was 56.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.00ms. Allocated memory is still 185.6MB. Free memory was 102.2MB in the beginning and 99.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.74ms. Allocated memory is still 185.6MB. Free memory was 98.6MB in the beginning and 96.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 618.78ms. Allocated memory was 185.6MB in the beginning and 239.1MB in the end (delta: 53.5MB). Free memory was 96.0MB in the beginning and 205.0MB in the end (delta: -109.1MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 82284.86ms. Allocated memory was 239.1MB in the beginning and 980.4MB in the end (delta: 741.3MB). Free memory was 203.4MB in the beginning and 778.4MB in the end (delta: -574.9MB). Peak memory consumption was 166.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 45.6s, 148 PlacesBefore, 57 PlacesAfterwards, 146 TransitionsBefore, 53 TransitionsAfterwards, 2704 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 60 TrivialYvCompositions, 48 ConcurrentYvCompositions, 2 ChoiceCompositions, 113 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3102, independent: 2949, independent conditional: 2949, independent unconditional: 0, dependent: 94, dependent conditional: 94, dependent unconditional: 0, unknown: 59, unknown conditional: 59, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 3102, independent: 2949, independent conditional: 0, independent unconditional: 2949, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 59, unknown conditional: 0, unknown unconditional: 59] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3102, independent: 2949, independent conditional: 0, independent unconditional: 2949, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 59, unknown conditional: 0, unknown unconditional: 59] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3102, independent: 2949, independent conditional: 0, independent unconditional: 2949, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 59, unknown conditional: 0, unknown unconditional: 59] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1894, independent: 1839, independent conditional: 0, independent unconditional: 1839, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1894, independent: 1828, independent conditional: 0, independent unconditional: 1828, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 11, independent conditional: 0, independent unconditional: 11, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 16, unknown conditional: 0, unknown unconditional: 16] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35554, independent: 94, independent conditional: 0, independent unconditional: 94, dependent: 754, dependent conditional: 0, dependent unconditional: 754, unknown: 34706, unknown conditional: 0, unknown unconditional: 34706] ], Cache Queries: [ total: 3102, independent: 1110, independent conditional: 0, independent unconditional: 1110, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 1937, unknown conditional: 0, unknown unconditional: 1937] , Statistics on independence cache: Total cache size (in pairs): 3858, Positive cache size: 3819, Positive conditional cache size: 0, Positive unconditional cache size: 3819, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Unknown cache size: 16, Unknown conditional cache size: 0, Unknown unconditional cache size: 16, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 13.4s, 58 PlacesBefore, 57 PlacesAfterwards, 52 TransitionsBefore, 51 TransitionsAfterwards, 508 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 134, independent: 106, independent conditional: 106, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 24, unknown conditional: 24, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 134, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 24, unknown conditional: 0, unknown unconditional: 24] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 134, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 24, unknown conditional: 0, unknown unconditional: 24] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 134, independent: 106, independent conditional: 0, independent unconditional: 106, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 24, unknown conditional: 0, unknown unconditional: 24] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 47, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 47, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13195, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 13036, unknown conditional: 0, unknown unconditional: 13036] ], Cache Queries: [ total: 134, independent: 67, independent conditional: 0, independent unconditional: 67, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 65, unknown conditional: 0, unknown unconditional: 65] , 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: 6, Unknown conditional cache size: 0, Unknown unconditional cache size: 6, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.2s, 59 PlacesBefore, 59 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 642 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 47, independent conditional: 47, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 23, unknown conditional: 23, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 47, independent conditional: 2, independent unconditional: 45, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 23, unknown conditional: 0, unknown unconditional: 23] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 23, unknown conditional: 0, unknown unconditional: 23] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 23, unknown conditional: 0, unknown unconditional: 23] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , SemanticIndependenceRelation.Query Time [ms]: [ total: 17135, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 17135, unknown conditional: 0, unknown unconditional: 17135] ], Cache Queries: [ total: 72, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 32, unknown conditional: 0, unknown unconditional: 32] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 14, Unknown conditional cache size: 0, Unknown unconditional cache size: 14, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 61 PlacesBefore, 61 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 382 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): 50, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 14, Unknown conditional cache size: 0, Unknown unconditional cache size: 14, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.1s, 63 PlacesBefore, 63 PlacesAfterwards, 138 TransitionsBefore, 138 TransitionsAfterwards, 538 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: 4, 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: 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): 53, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 14, Unknown conditional cache size: 0, Unknown unconditional cache size: 14, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 65 PlacesBefore, 65 PlacesAfterwards, 167 TransitionsBefore, 167 TransitionsAfterwards, 674 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 55, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 14, Unknown conditional cache size: 0, Unknown unconditional cache size: 14, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 67 PlacesBefore, 67 PlacesAfterwards, 217 TransitionsBefore, 217 TransitionsAfterwards, 862 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): 55, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 14, Unknown conditional cache size: 0, Unknown unconditional cache size: 14, 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, EXPR 0 my_drv_probe(&data) [L1706] 0 struct device *d = &data->dev; [L1708] 0 data->shared.a = 0 [L1709] 0 data->shared.b = 0 [L1710] 0 int res = __VERIFIER_nondet_int(); [L1711] COND FALSE 0 !(\read(res)) [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={5:24}, d={5:24}, data={5:0}, data={5:0}, pthread_create(&t1, ((void *)0), my_callback, (void *)d)=7, 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)=8, pthread_mutex_lock (&data->lock)=0, res=0, t1={3:0}, t2={4:0}] [L1715] 0 return 0; VAL [\result=0, __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}] [L1749] RET, EXPR 0 my_drv_probe(&data) [L1749] 0 probe_ret = my_drv_probe(&data) [L1750] COND TRUE 0 probe_ret==0 [L1751] CALL 0 my_drv_disconnect(&data) [L1721] 0 void *status; [L1723] 0 data->shared.a = 3 VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, pthread_mutex_lock (&data->lock)=0, status={6:0}, t1={3:0}, t2={4:0}] [L1726] 0 data->shared.b = 3 VAL [__mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, data={5:0}, data={5:0}, dev={5:24}, pthread_mutex_lock (&data->lock)=0, status={6: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}] [L1729] EXPR 0 data->shared.a [L1729] CALL 0 ldv_assert(data->shared.a==3) [L1675] COND TRUE 0 !expression [L1675] 0 reach_error() VAL [\old(expression)=0, __mptr={5:24}, arg={5:24}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, t1={3:0}, t2={4:0}] - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1713]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1714]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 168 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 82.1s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 45.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 107 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 107 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 589 IncrementalHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 24 mSDtfsCounter, 589 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2892occurred in iteration=6, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 150 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 06:30:08,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...