/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/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps '"3,2 1,1 2,2"' --traceabstraction.defines.what.statements.are.considered.a.step.in.por ALL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_3-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 05:04:10,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 05:04:10,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 05:04:10,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 05:04:10,876 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 05:04:10,877 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 05:04:10,878 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 05:04:10,880 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 05:04:10,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 05:04:10,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 05:04:10,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 05:04:10,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 05:04:10,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 05:04:10,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 05:04:10,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 05:04:10,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 05:04:10,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 05:04:10,889 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 05:04:10,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 05:04:10,893 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 05:04:10,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 05:04:10,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 05:04:10,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 05:04:10,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 05:04:10,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 05:04:10,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 05:04:10,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 05:04:10,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 05:04:10,902 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 05:04:10,903 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 05:04:10,903 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 05:04:10,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 05:04:10,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 05:04:10,905 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 05:04:10,906 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 05:04:10,906 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 05:04:10,907 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 05:04:10,907 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 05:04:10,907 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 05:04:10,908 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 05:04:10,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 05:04:10,910 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 05:04:10,932 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 05:04:10,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 05:04:10,932 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 05:04:10,932 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 05:04:10,933 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 05:04:10,933 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 05:04:10,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 05:04:10,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 05:04:10,934 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 05:04:10,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 05:04:10,934 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 05:04:10,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 05:04:10,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 05:04:10,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 05:04:10,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 05:04:10,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 05:04:10,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 05:04:10,935 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 05:04:10,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 05:04:10,936 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 05:04:10,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 05:04:10,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 05:04:10,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 05:04:10,936 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 05:04:10,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 05:04:10,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 05:04:10,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 05:04:10,937 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 05:04:10,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 05:04:10,937 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 05:04:10,937 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 05:04:10,938 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 05:04:10,938 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 05:04:10,938 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 05:04:10,938 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 05:04:10,938 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 05:04:10,938 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: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> 3,2 1,1 2,2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> ALL_READ_WRITE [2023-05-04 05:04:11,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 05:04:11,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 05:04:11,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 05:04:11,208 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 05:04:11,209 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 05:04:11,210 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_3-container_of.i [2023-05-04 05:04:11,276 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/104ba86ed/49867b8da5a6432eaba5af4e98bbd514/FLAGe51974ff9 [2023-05-04 05:04:11,818 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 05:04:11,819 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_3-container_of.i [2023-05-04 05:04:11,842 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/104ba86ed/49867b8da5a6432eaba5af4e98bbd514/FLAGe51974ff9 [2023-05-04 05:04:12,078 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/104ba86ed/49867b8da5a6432eaba5af4e98bbd514 [2023-05-04 05:04:12,081 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 05:04:12,082 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 05:04:12,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 05:04:12,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 05:04:12,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 05:04:12,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 05:04:12" (1/1) ... [2023-05-04 05:04:12,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f0cee38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:12, skipping insertion in model container [2023-05-04 05:04:12,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 05:04:12" (1/1) ... [2023-05-04 05:04:12,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 05:04:12,152 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 05:04:12,291 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-05-04 05:04:12,651 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_3-container_of.i[75002,75015] [2023-05-04 05:04:12,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 05:04:12,711 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 05:04:12,722 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2023-05-04 05:04:12,768 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_3-container_of.i[75002,75015] [2023-05-04 05:04:12,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 05:04:12,870 INFO L208 MainTranslator]: Completed translation [2023-05-04 05:04:12,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:12 WrapperNode [2023-05-04 05:04:12,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 05:04:12,872 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 05:04:12,872 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 05:04:12,872 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 05:04:12,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:12" (1/1) ... [2023-05-04 05:04:12,901 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:12" (1/1) ... [2023-05-04 05:04:12,925 INFO L138 Inliner]: procedures = 469, calls = 63, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 143 [2023-05-04 05:04:12,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 05:04:12,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 05:04:12,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 05:04:12,927 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 05:04:12,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:12" (1/1) ... [2023-05-04 05:04:12,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:12" (1/1) ... [2023-05-04 05:04:12,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:12" (1/1) ... [2023-05-04 05:04:12,945 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:12" (1/1) ... [2023-05-04 05:04:12,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:12" (1/1) ... [2023-05-04 05:04:12,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:12" (1/1) ... [2023-05-04 05:04:12,970 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:12" (1/1) ... [2023-05-04 05:04:12,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:12" (1/1) ... [2023-05-04 05:04:12,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 05:04:12,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 05:04:12,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 05:04:12,978 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 05:04:12,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:12" (1/1) ... [2023-05-04 05:04:12,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 05:04:13,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 05:04:13,015 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) [2023-05-04 05:04:13,028 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 [2023-05-04 05:04:13,055 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-05-04 05:04:13,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 05:04:13,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-05-04 05:04:13,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 05:04:13,057 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-05-04 05:04:13,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 05:04:13,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-05-04 05:04:13,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 05:04:13,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 05:04:13,058 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2023-05-04 05:04:13,058 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2023-05-04 05:04:13,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 05:04:13,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 05:04:13,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 05:04:13,060 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 05:04:13,359 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 05:04:13,361 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 05:04:13,564 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 05:04:13,614 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 05:04:13,614 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-05-04 05:04:13,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 05:04:13 BoogieIcfgContainer [2023-05-04 05:04:13,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 05:04:13,672 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 05:04:13,673 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 05:04:13,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 05:04:13,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 05:04:12" (1/3) ... [2023-05-04 05:04:13,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f1ae33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 05:04:13, skipping insertion in model container [2023-05-04 05:04:13,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 05:04:12" (2/3) ... [2023-05-04 05:04:13,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f1ae33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 05:04:13, skipping insertion in model container [2023-05-04 05:04:13,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 05:04:13" (3/3) ... [2023-05-04 05:04:13,681 INFO L112 eAbstractionObserver]: Analyzing ICFG race-2_3-container_of.i [2023-05-04 05:04:13,687 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 05:04:13,695 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 05:04:13,696 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-05-04 05:04:13,696 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 05:04:13,756 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-04 05:04:13,805 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 05:04:13,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 05:04:13,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 05:04:13,809 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-05-04 05:04:13,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-05-04 05:04:13,853 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 05:04:13,872 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 05:04:13,877 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@59c4fac3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 05:04:13,878 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2023-05-04 05:04:26,267 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-05-04 05:04:26,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:04:26,271 INFO L85 PathProgramCache]: Analyzing trace with hash 430406609, now seen corresponding path program 1 times [2023-05-04 05:04:26,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:04:26,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788915543] [2023-05-04 05:04:26,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:04:26,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:04:26,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:04:28,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 05:04:28,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 05:04:28,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788915543] [2023-05-04 05:04:28,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788915543] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 05:04:28,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 05:04:28,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-05-04 05:04:28,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319730119] [2023-05-04 05:04:28,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 05:04:28,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-05-04 05:04:28,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 05:04:28,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-05-04 05:04:28,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-05-04 05:04:28,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:04:28,703 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 05:04:28,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 17 states have internal predecessors, (78), 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) [2023-05-04 05:04:28,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:04:33,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-04 05:04:33,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 05:04:33,154 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)] === [2023-05-04 05:04:33,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:04:33,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1777021560, now seen corresponding path program 1 times [2023-05-04 05:04:33,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:04:33,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897195678] [2023-05-04 05:04:33,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:04:33,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:04:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:04:33,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 05:04:33,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 05:04:33,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897195678] [2023-05-04 05:04:33,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897195678] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 05:04:33,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 05:04:33,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-05-04 05:04:33,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214894793] [2023-05-04 05:04:33,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 05:04:33,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-05-04 05:04:33,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 05:04:33,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-05-04 05:04:33,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-05-04 05:04:33,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:04:33,812 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 05:04:33,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.5) internal successors, (75), 11 states have internal predecessors, (75), 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) [2023-05-04 05:04:33,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-05-04 05:04:33,813 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:04:36,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-05-04 05:04:36,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:04:36,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 05:04:36,366 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-05-04 05:04:36,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:04:36,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1148699989, now seen corresponding path program 1 times [2023-05-04 05:04:36,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:04:36,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29538305] [2023-05-04 05:04:36,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:04:36,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:04:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:04:37,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 05:04:37,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 05:04:37,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29538305] [2023-05-04 05:04:37,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29538305] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 05:04:37,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 05:04:37,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-05-04 05:04:37,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119513378] [2023-05-04 05:04:37,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 05:04:37,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-05-04 05:04:37,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 05:04:37,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-05-04 05:04:37,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-05-04 05:04:37,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:04:37,056 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 05:04:37,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.9) internal successors, (79), 11 states have internal predecessors, (79), 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) [2023-05-04 05:04:37,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-05-04 05:04:37,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:04:37,056 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:04:41,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-05-04 05:04:41,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:04:41,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:04:41,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-04 05:04:41,851 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)] === [2023-05-04 05:04:41,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:04:41,852 INFO L85 PathProgramCache]: Analyzing trace with hash 804085504, now seen corresponding path program 1 times [2023-05-04 05:04:41,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:04:41,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063705757] [2023-05-04 05:04:41,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:04:41,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:04:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:04:41,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 05:04:41,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 05:04:41,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063705757] [2023-05-04 05:04:41,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063705757] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 05:04:41,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 05:04:41,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-05-04 05:04:41,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000630069] [2023-05-04 05:04:41,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 05:04:41,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-05-04 05:04:41,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 05:04:41,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-05-04 05:04:41,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-05-04 05:04:41,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:04:41,983 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 05:04:41,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 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) [2023-05-04 05:04:41,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-05-04 05:04:41,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:04:41,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:04:41,984 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:04:42,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-05-04 05:04:42,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:04:42,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:04:42,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 05:04:42,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-05-04 05:04:42,098 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-05-04 05:04:42,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:04:42,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1128791756, now seen corresponding path program 1 times [2023-05-04 05:04:42,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:04:42,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769331732] [2023-05-04 05:04:42,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:04:42,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:04:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:04:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 05:04:43,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 05:04:43,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769331732] [2023-05-04 05:04:43,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769331732] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 05:04:43,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 05:04:43,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-05-04 05:04:43,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743274966] [2023-05-04 05:04:43,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 05:04:43,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-05-04 05:04:43,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 05:04:43,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-05-04 05:04:43,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2023-05-04 05:04:43,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:04:43,761 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 05:04:43,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.105263157894737) internal successors, (116), 19 states have internal predecessors, (116), 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) [2023-05-04 05:04:43,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-05-04 05:04:43,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:04:43,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:04:43,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 05:04:43,762 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:04:48,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-05-04 05:04:48,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:04:48,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:04:48,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 05:04:48,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 05:04:48,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-04 05:04:48,269 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-05-04 05:04:48,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:04:48,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1729801734, now seen corresponding path program 1 times [2023-05-04 05:04:48,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:04:48,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86312208] [2023-05-04 05:04:48,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:04:48,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:04:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:04:48,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 05:04:48,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 05:04:48,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86312208] [2023-05-04 05:04:48,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86312208] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 05:04:48,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 05:04:48,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-05-04 05:04:48,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558353457] [2023-05-04 05:04:48,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 05:04:48,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-05-04 05:04:48,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 05:04:48,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-05-04 05:04:48,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-05-04 05:04:48,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:04:48,748 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 05:04:48,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.0) internal successors, (144), 6 states have internal predecessors, (144), 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) [2023-05-04 05:04:48,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-05-04 05:04:48,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:04:48,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:04:48,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 05:04:48,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 05:04:48,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:04:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-05-04 05:04:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:04:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:04:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 05:04:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 05:04:48,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:04:48,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-04 05:04:48,868 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-05-04 05:04:48,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:04:48,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1035102051, now seen corresponding path program 1 times [2023-05-04 05:04:48,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:04:48,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028604075] [2023-05-04 05:04:48,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:04:48,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:04:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 05:04:49,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-04 05:04:49,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 05:04:49,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028604075] [2023-05-04 05:04:49,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028604075] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 05:04:49,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 05:04:49,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-05-04 05:04:49,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779785771] [2023-05-04 05:04:49,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 05:04:49,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-05-04 05:04:49,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 05:04:49,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-05-04 05:04:49,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-05-04 05:04:49,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:04:49,251 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 05:04:49,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.666666666666668) internal successors, (136), 6 states have internal predecessors, (136), 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) [2023-05-04 05:04:49,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-05-04 05:04:49,252 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:04:49,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:04:49,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-04 05:04:49,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-05-04 05:04:49,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:04:49,253 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 05:04:49,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-05-04 05:04:49,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:04:49,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:04:49,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-04 05:04:49,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-05-04 05:04:49,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-04 05:04:49,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-05-04 05:04:49,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-04 05:04:49,377 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2023-05-04 05:04:49,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 05:04:49,377 INFO L85 PathProgramCache]: Analyzing trace with hash 484209371, now seen corresponding path program 1 times [2023-05-04 05:04:49,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 05:04:49,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342285554] [2023-05-04 05:04:49,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 05:04:49,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 05:04:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 05:04:49,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-05-04 05:04:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-05-04 05:04:49,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-05-04 05:04:49,585 INFO L359 BasicCegarLoop]: Counterexample is feasible [2023-05-04 05:04:49,586 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2023-05-04 05:04:49,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2023-05-04 05:04:49,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2023-05-04 05:04:49,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2023-05-04 05:04:49,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2023-05-04 05:04:49,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2023-05-04 05:04:49,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2023-05-04 05:04:49,588 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2023-05-04 05:04:49,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-05-04 05:04:49,598 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2023-05-04 05:04:49,603 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 05:04:49,603 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 05:04:49,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 05:04:49 BasicIcfg [2023-05-04 05:04:49,715 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 05:04:49,715 INFO L158 Benchmark]: Toolchain (without parser) took 37633.71ms. Allocated memory was 189.8MB in the beginning and 248.5MB in the end (delta: 58.7MB). Free memory was 160.4MB in the beginning and 85.4MB in the end (delta: 75.0MB). Peak memory consumption was 133.0MB. Max. memory is 8.0GB. [2023-05-04 05:04:49,716 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 189.8MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 05:04:49,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 788.49ms. Allocated memory was 189.8MB in the beginning and 248.5MB in the end (delta: 58.7MB). Free memory was 160.0MB in the beginning and 174.0MB in the end (delta: -14.0MB). Peak memory consumption was 49.2MB. Max. memory is 8.0GB. [2023-05-04 05:04:49,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.31ms. Allocated memory is still 248.5MB. Free memory was 174.0MB in the beginning and 170.4MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-04 05:04:49,718 INFO L158 Benchmark]: Boogie Preprocessor took 50.35ms. Allocated memory is still 248.5MB. Free memory was 170.4MB in the beginning and 167.7MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-04 05:04:49,718 INFO L158 Benchmark]: RCFGBuilder took 638.54ms. Allocated memory is still 248.5MB. Free memory was 167.7MB in the beginning and 140.4MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2023-05-04 05:04:49,718 INFO L158 Benchmark]: TraceAbstraction took 36042.45ms. Allocated memory is still 248.5MB. Free memory was 216.7MB in the beginning and 85.4MB in the end (delta: 131.3MB). Peak memory consumption was 131.1MB. Max. memory is 8.0GB. [2023-05-04 05:04:49,721 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.15ms. Allocated memory is still 189.8MB. Free memory is still 142.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 788.49ms. Allocated memory was 189.8MB in the beginning and 248.5MB in the end (delta: 58.7MB). Free memory was 160.0MB in the beginning and 174.0MB in the end (delta: -14.0MB). Peak memory consumption was 49.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.31ms. Allocated memory is still 248.5MB. Free memory was 174.0MB in the beginning and 170.4MB in the end (delta: 3.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 50.35ms. Allocated memory is still 248.5MB. Free memory was 170.4MB in the beginning and 167.7MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 638.54ms. Allocated memory is still 248.5MB. Free memory was 167.7MB in the beginning and 140.4MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 36042.45ms. Allocated memory is still 248.5MB. Free memory was 216.7MB in the beginning and 85.4MB in the end (delta: 131.3MB). Peak memory consumption was 131.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2748, independent: 2384, independent conditional: 675, independent unconditional: 1709, dependent: 327, dependent conditional: 307, dependent unconditional: 20, unknown: 37, unknown conditional: 25, unknown unconditional: 12] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2478, independent: 2384, independent conditional: 675, independent unconditional: 1709, dependent: 57, dependent conditional: 37, dependent unconditional: 20, unknown: 37, unknown conditional: 25, unknown unconditional: 12] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2478, independent: 2384, independent conditional: 675, independent unconditional: 1709, dependent: 57, dependent conditional: 37, dependent unconditional: 20, unknown: 37, unknown conditional: 25, unknown unconditional: 12] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2695, independent: 2384, independent conditional: 32, independent unconditional: 2352, dependent: 218, dependent conditional: 122, dependent unconditional: 96, unknown: 93, unknown conditional: 63, unknown unconditional: 30] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2695, independent: 2384, independent conditional: 32, independent unconditional: 2352, dependent: 218, dependent conditional: 104, dependent unconditional: 114, unknown: 93, unknown conditional: 63, unknown unconditional: 30] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2695, independent: 2384, independent conditional: 32, independent unconditional: 2352, dependent: 218, dependent conditional: 104, dependent unconditional: 114, unknown: 93, unknown conditional: 63, unknown unconditional: 30] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1785, independent: 1717, independent conditional: 7, independent unconditional: 1710, dependent: 45, dependent conditional: 22, dependent unconditional: 23, unknown: 23, unknown conditional: 11, unknown unconditional: 12] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1785, independent: 1706, independent conditional: 0, independent unconditional: 1706, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 79, independent: 11, independent conditional: 7, independent unconditional: 4, dependent: 45, dependent conditional: 22, dependent unconditional: 23, unknown: 23, unknown conditional: 11, unknown unconditional: 12] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 11, independent conditional: 7, independent unconditional: 4, dependent: 45, dependent conditional: 22, dependent unconditional: 23, unknown: 23, unknown conditional: 11, unknown unconditional: 12] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25696, independent: 159, independent conditional: 32, independent unconditional: 127, dependent: 661, dependent conditional: 232, dependent unconditional: 429, unknown: 24875, unknown conditional: 11960, unknown unconditional: 12915] , Protected Queries: 0 ], Cache Queries: [ total: 2695, independent: 667, independent conditional: 25, independent unconditional: 642, dependent: 173, dependent conditional: 82, dependent unconditional: 91, unknown: 1855, unknown conditional: 92, unknown unconditional: 1763] , Statistics on independence cache: Total cache size (in pairs): 1762, Positive cache size: 1717, Positive conditional cache size: 7, Positive unconditional cache size: 1710, Negative cache size: 45, Negative conditional cache size: 22, Negative unconditional cache size: 23, Unknown cache size: 23, Unknown conditional cache size: 11, Unknown unconditional cache size: 12, Eliminated conditions: 18, Maximal queried relation: 6, Independence queries for same thread: 270 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 13.5s, Number of persistent set computation: 184, Number of trivial persistent sets: 184, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1741, independent: 1709, independent conditional: 0, independent unconditional: 1709, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2748, independent: 2384, independent conditional: 675, independent unconditional: 1709, dependent: 327, dependent conditional: 307, dependent unconditional: 20, unknown: 37, unknown conditional: 25, unknown unconditional: 12] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2478, independent: 2384, independent conditional: 675, independent unconditional: 1709, dependent: 57, dependent conditional: 37, dependent unconditional: 20, unknown: 37, unknown conditional: 25, unknown unconditional: 12] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2478, independent: 2384, independent conditional: 675, independent unconditional: 1709, dependent: 57, dependent conditional: 37, dependent unconditional: 20, unknown: 37, unknown conditional: 25, unknown unconditional: 12] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2695, independent: 2384, independent conditional: 32, independent unconditional: 2352, dependent: 218, dependent conditional: 122, dependent unconditional: 96, unknown: 93, unknown conditional: 63, unknown unconditional: 30] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2695, independent: 2384, independent conditional: 32, independent unconditional: 2352, dependent: 218, dependent conditional: 104, dependent unconditional: 114, unknown: 93, unknown conditional: 63, unknown unconditional: 30] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2695, independent: 2384, independent conditional: 32, independent unconditional: 2352, dependent: 218, dependent conditional: 104, dependent unconditional: 114, unknown: 93, unknown conditional: 63, unknown unconditional: 30] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1785, independent: 1717, independent conditional: 7, independent unconditional: 1710, dependent: 45, dependent conditional: 22, dependent unconditional: 23, unknown: 23, unknown conditional: 11, unknown unconditional: 12] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1785, independent: 1706, independent conditional: 0, independent unconditional: 1706, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 79, independent: 11, independent conditional: 7, independent unconditional: 4, dependent: 45, dependent conditional: 22, dependent unconditional: 23, unknown: 23, unknown conditional: 11, unknown unconditional: 12] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 11, independent conditional: 7, independent unconditional: 4, dependent: 45, dependent conditional: 22, dependent unconditional: 23, unknown: 23, unknown conditional: 11, unknown unconditional: 12] , SemanticIndependenceRelation.Query Time [ms]: [ total: 25696, independent: 159, independent conditional: 32, independent unconditional: 127, dependent: 661, dependent conditional: 232, dependent unconditional: 429, unknown: 24875, unknown conditional: 11960, unknown unconditional: 12915] , Protected Queries: 0 ], Cache Queries: [ total: 2695, independent: 667, independent conditional: 25, independent unconditional: 642, dependent: 173, dependent conditional: 82, dependent unconditional: 91, unknown: 1855, unknown conditional: 92, unknown unconditional: 1763] , Statistics on independence cache: Total cache size (in pairs): 1762, Positive cache size: 1717, Positive conditional cache size: 7, Positive unconditional cache size: 1710, Negative cache size: 45, Negative conditional cache size: 22, Negative unconditional cache size: 23, Unknown cache size: 23, Unknown conditional cache size: 11, Unknown unconditional cache size: 12, Eliminated conditions: 18, Maximal queried relation: 6, Independence queries for same thread: 270 - 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; VAL [t1={3:0}, t2={4:0}] [L1745] CALL, EXPR 0 my_drv_init() [L1739] 0 return 0; VAL [\result=0, t1={3:0}, t2={4:0}] [L1745] RET, EXPR 0 my_drv_init() [L1745] 0 int ret = my_drv_init(); VAL [my_drv_init()=0, ret=0, t1={3:0}, t2={4:0}] [L1746] COND TRUE 0 ret==0 VAL [ret=0, t1={3:0}, t2={4:0}] [L1747] 0 int probe_ret; VAL [ret=0, t1={3:0}, t2={4:0}] [L1748] 0 struct my_data data; VAL [data={8:0}, ret=0, t1={3:0}, t2={4:0}] [L1749] CALL, EXPR 0 my_drv_probe(&data) [L1706] 0 struct device *d = &data->dev; VAL [d={8:24}, data={8:0}, data={8:0}, t1={3:0}, t2={4:0}] [L1708] 0 data->shared.a = 0 VAL [d={8:24}, data={8:0}, data={8:0}, t1={3:0}, t2={4:0}] [L1709] 0 data->shared.b = 0 VAL [d={8:24}, data={8:0}, data={8:0}, t1={3:0}, t2={4:0}] [L1710] 0 int res = __VERIFIER_nondet_int(); VAL [__VERIFIER_nondet_int()=0, d={8:24}, data={8:0}, data={8:0}, res=0, t1={3:0}, t2={4:0}] [L1711] COND FALSE 0 !(\read(res)) VAL [d={8:24}, data={8:0}, data={8:0}, res=0, t1={3:0}, t2={4:0}] [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [arg={8:24}, d={8:24}, data={8:0}, data={8:0}, pthread_create(&t1, ((void *)0), my_callback, (void *)d)=6, res=0, t1={3:0}, t2={4:0}] [L1689] 1 struct device *dev = (struct device*)arg; VAL [arg={8:24}, arg={8:24}, dev={8:24}, t1={3:0}, t2={4:0}] [L1690] 1 struct my_data *data; VAL [arg={8:24}, arg={8:24}, dev={8:24}, t1={3:0}, t2={4:0}] [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [__mptr={8:24}, arg={8:24}, arg={8:24}, dev={8:24}, t1={3:0}, t2={4:0}] [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={8:24}, arg={8:24}, arg={8:24}, data={8:0}, dev={8:24}, t1={3:0}, t2={4:0}] [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [__mptr={8:24}, arg={8:24}, arg={8:24}, d={8:24}, data={8:0}, data={8:0}, data={8:0}, dev={8:24}, pthread_create(&t2, ((void *)0), my_callback, (void *)d)=7, pthread_mutex_lock (&data->lock)=0, res=0, t1={3:0}, t2={4:0}] [L1689] 2 struct device *dev = (struct device*)arg; VAL [__mptr={8:24}, arg={8:24}, arg={8:24}, data={8:0}, dev={8:24}, t1={3:0}, t2={4:0}] [L1694] 1 data->shared.a = 1 VAL [__mptr={8:24}, arg={8:24}, arg={8:24}, data={8:0}, dev={8:24}, t1={3:0}, t2={4:0}] [L1690] 2 struct my_data *data; VAL [__mptr={8:24}, arg={8:24}, arg={8:24}, data={8:0}, dev={8:24}, t1={3:0}, t2={4:0}] [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); VAL [__mptr={8:24}, arg={8:24}, arg={8:24}, data={8:0}, dev={8:24}, t1={3:0}, t2={4:0}] [L1697] EXPR 1 data->shared.b [L1697] 1 int lb = data->shared.b; [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) VAL [__mptr={8:24}, arg={8:24}, arg={8:24}, data={8:0}, dev={8:24}, lb=0, t1={3:0}, t2={4:0}] [L1716] 0 data->shared.a = 3 VAL [__mptr={8:24}, arg={8:24}, arg={8:24}, d={8:24}, data={8:0}, data={8:0}, data={8:0}, dev={8:24}, lb=0, res=0, t1={3:0}, t2={4:0}] [L1700] 1 data->shared.b = lb + 1 VAL [__mptr={8:24}, arg={8:24}, arg={8:24}, data={8:0}, dev={8:24}, lb=0, t1={3:0}, t2={4:0}] [L1719] 0 data->shared.b = 3 VAL [__mptr={8:24}, arg={8:24}, arg={8:24}, d={8:24}, data={8:0}, data={8:0}, data={8:0}, dev={8:24}, lb=0, res=0, t1={3:0}, t2={4:0}] [L1722] EXPR 0 data->shared.a [L1722] CALL 0 ldv_assert(data->shared.a==3) [L1675] COND FALSE 0 !(!expression) [L1722] RET 0 ldv_assert(data->shared.a==3) [L1703] 1 return 0; VAL [\result={0:0}, __mptr={8:24}, arg={8:24}, arg={8:24}, data={8:0}, dev={8:24}, lb=0, t1={3:0}, t2={4:0}] [L1694] 2 data->shared.a = 1 VAL [\result={0:0}, __mptr={8:24}, arg={8:24}, arg={8:24}, data={8:0}, dev={8:24}, lb=0, t1={3:0}, t2={4:0}] [L1697] EXPR 2 data->shared.b [L1697] 2 int lb = data->shared.b; [L1725] EXPR 0 data->shared.b [L1725] CALL 0 ldv_assert(data->shared.b==3) [L1675] COND FALSE 0 !(!expression) [L1725] RET 0 ldv_assert(data->shared.b==3) [L1700] 2 data->shared.b = lb + 1 VAL [\result={0:0}, __mptr={8:24}, arg={8:24}, arg={8:24}, data={8:0}, dev={8:24}, lb=0, t1={3:0}, t2={4:0}] [L1727] 0 return 0; VAL [\result=0, \result={0:0}, __mptr={8:24}, arg={8:24}, arg={8:24}, d={8:24}, data={8:0}, data={8:0}, data={8:0}, dev={8:24}, lb=0, res=0, t1={3:0}, t2={4:0}] [L1703] 2 return 0; VAL [\result={0:0}, __mptr={8:24}, arg={8:24}, arg={8:24}, data={8:0}, dev={8:24}, lb=0, t1={3:0}, t2={4:0}] [L1749] RET, EXPR 0 my_drv_probe(&data) [L1749] 0 probe_ret = my_drv_probe(&data) VAL [\result={0:0}, __mptr={8:24}, arg={8:24}, arg={8:24}, data={8:0}, data={8:0}, dev={8:24}, lb=0, my_drv_probe(&data)=0, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1750] COND TRUE 0 probe_ret==0 VAL [\result={0:0}, __mptr={8:24}, arg={8:24}, arg={8:24}, data={8:0}, data={8:0}, dev={8:24}, lb=0, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1751] CALL 0 my_drv_disconnect(&data) [L1733] 0 void *status; VAL [\result={0:0}, __mptr={8:24}, arg={8:24}, arg={8:24}, data={8:0}, data={8:0}, data={8:0}, dev={8:24}, lb=0, status={10:0}, t1={3:0}, t2={4:0}] [L1734] 0 \read(t1) VAL [\read(t1)=6, \result={0:0}, __mptr={8:24}, arg={8:24}, arg={8:24}, data={8:0}, data={8:0}, data={8:0}, dev={8:24}, lb=0, status={10:0}, t1={3:0}, t2={4:0}] [L1734] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\read(t1)=6, \result={0:0}, __mptr={8:24}, arg={8:24}, arg={8:24}, data={8:0}, data={8:0}, data={8:0}, dev={8:24}, lb=0, pthread_join(t1, &status)={0:0}, status={10:0}, t1={3:0}, t2={4:0}] [L1735] 0 \read(t2) VAL [\read(t2)=7, \result={0:0}, __mptr={8:24}, arg={8:24}, arg={8:24}, data={8:0}, data={8:0}, data={8:0}, dev={8:24}, lb=0, status={10:0}, t1={3:0}, t2={4:0}] [L1735] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\read(t2)=7, \result={0:0}, __mptr={8:24}, arg={8:24}, arg={8:24}, data={8:0}, data={8:0}, data={8:0}, dev={8:24}, lb=0, pthread_join(t2, &status)={0:0}, status={10:0}, t1={3:0}, t2={4:0}] [L1751] RET 0 my_drv_disconnect(&data) [L1752] EXPR 0 data.shared.a VAL [\result={0:0}, __mptr={8:24}, arg={8:24}, arg={8:24}, data={8:0}, data={8:0}, data.shared.a=1, dev={8:24}, lb=0, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1752] CALL 0 ldv_assert(data.shared.a==1) [L1675] COND FALSE 0 !(!expression) VAL [\old(expression)=1, \result={0:0}, __mptr={8:24}, arg={8:24}, arg={8:24}, data={8:0}, dev={8:24}, expression=1, lb=0, t1={3:0}, t2={4:0}] [L1752] RET 0 ldv_assert(data.shared.a==1) [L1753] EXPR 0 data.shared.b VAL [\result={0:0}, __mptr={8:24}, arg={8:24}, arg={8:24}, data={8:0}, data={8:0}, data.shared.b=4, dev={8:24}, lb=0, probe_ret=0, ret=0, t1={3:0}, t2={4:0}] [L1753] CALL 0 ldv_assert(data.shared.b==2) [L1675] COND TRUE 0 !expression VAL [\old(expression)=0, \result={0:0}, __mptr={8:24}, arg={8:24}, arg={8:24}, data={8:0}, dev={8:24}, expression=0, lb=0, t1={3:0}, t2={4:0}] [L1675] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __mptr={8:24}, arg={8:24}, arg={8:24}, data={8:0}, dev={8:24}, expression=0, lb=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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 4 procedures, 185 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 35.8s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 29.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 80, 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.4s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 862 NumberOfCodeBlocks, 862 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 731 ConstructedInterpolants, 0 QuantifiedInterpolants, 4251 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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! [2023-05-04 05:04:49,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2023-05-04 05:04:49,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...